Adaptive Colour Transform in Image/Video Coding

ABSTRACT

A method for implementing an adaptive colour transform (ACT) mode during image/video encoding and decoding includes performing a conversion between a current video block of a video and a bitstream of the video, wherein the current video block is coded using the ACT mode, wherein the conversion includes applying an inverse ACT transform on the current video block according to a rule, and wherein the rule specifies that a clipping operation, based on a bit depth of the current video block, is applied to an input of the inverse ACT transform.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application No. 17/867,284, filed on Jul. 18, 2022, which is a continuation of International Patent Application No. PCT/CN2021/072396, filed on Jan. 18, 2021, which claims the priority to and benefits of International Patent Application No. PCT/CN2020/072900 filed on Jan. 18, 2020. All the aforementioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

The present disclosure relates to image and video coding and decoding.

BACKGROUND

Digital video accounts for the largest bandwidth use on the internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, it is expected that the bandwidth demand for digital video usage will continue to grow.

SUMMARY

The present disclosure includes systems, methods, and devices for video encoding and decoding that include an adaptive colour transform (ACT).

In one example aspect, a method of video processing is disclosed. The method includes performing a conversion between a current video block of a video and a bitstream of the video, wherein the current video block is coded using an adaptive colour transform (ACT) mode, wherein the conversion comprises applying an inverse ACT transform on the current video block according to a rule, and wherein the rule specifies that a clipping operation, based on a bit depth of the current video block, is applied to an input of the inverse ACT transform.

In another example aspect, a method of video processing is disclosed. The method includes performing a conversion between a video comprising a current video block and a bitstream of the video, wherein, during the conversion, a weighted prediction of the current video block is determined using weights, and wherein the weights are signaled in the bitstream as information indictive of a difference between a number of the weights and a threshold K, where K is an integer.

In yet another example aspect, a video encoder apparatus is disclosed. The video encoder comprises a processor configured to implement the above-described methods.

In yet another example aspect, a video decoder apparatus is disclosed. The video decoder comprises a processor configured to implement the above-described methods.

In yet another example aspect, a non-transitory computer readable medium having code stored thereon is disclose. The code embodies one of the methods described herein in the form of processor-executable code.

These, and other, features are described throughout the present disclosure.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 shows a screen content coding (SCC) decoder flow of in-loop adaptive colour transform (ACT).

FIG. 2 illustrates a decoding process with the ACT.

FIG. 3 shows an example of a block coded in palette mode.

FIG. 4 shows an example of using of palette predictor to signal palette entries.

FIG. 5 shows an example of horizontal and vertical traverse scans.

FIG. 6 shows an example of coding of palette indices.

FIG. 7 is a block diagram showing an example video processing system according to various embodiments of the disclosure.

FIG. 8 is a block diagram of an example hardware platform used for video processing.

FIG. 9 is a block diagram that illustrates a video coding system according to various embodiments of the disclosure.

FIG. 10 is a block diagram that illustrates an encoder according to various embodiments of the disclosure.

FIG. 11 is a block diagram that illustrates a decoder according to various embodiments of the disclosure.

FIGS. 12-13 show flowcharts for example methods of video processing.

DETAILED DESCRIPTION

Section headings are used in the present disclosure for ease of understanding and do not limit the applicability of embodiments disclosed in each section only to that section. Furthermore, H.266 terminology is used in some description only for ease of understanding and not for limiting scope of the disclosed embodiments. As such, the embodiments described herein are applicable to other video codec protocols and designs also.

1. Initial Discussion

The present disclosure is related to image/video coding technologies. Specifically, it is related to adaptive colour transform in image/video coding. It may be applied to the standard under development, e.g. Versatile Video Coding (VVC). It may be also applicable to future video coding standards or video codec.

2. Video Coding Introduction

Video coding standards have evolved primarily through the development of the well-known International Telecommunication Union (ITU) Telecommunication Standardization Sector (ITU-T) and International Organization for Standardization (ISO)/International Electrotechnical Commission (IEC)standards. The ITU-T produced H.261 and H.263, ISO/IEC produced MPEG-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4 Advanced Video Coding (AVC) and H.265/HEVC standards. Since H.262, the video coding standards are based on the hybrid video coding structure wherein temporal prediction plus transform coding are utilized. To explore the future video coding technologies beyond HEVC, Joint Video Exploration Team (JVET) was founded by video coding experts group (VCEG) and moving pictures experts group (MPEG) jointly in 2015. Since then, many new methods have been adopted by JVET and put into the reference software named Joint Exploration Model (JEM). In April 2018, the Joint Video Expert Team (JVET) between VCEG (Q6/16) and ISO/IEC JTC1 SC29/WG11 (MPEG) was created to work on the VVC standard targeting at 50% bitrate reduction compared to HEVC.

The latest version of VVC draft, i.e., Versatile Video Coding (Draft 7) could be found at: http://phenix.it-sudparis.eu/jvet/doc_end_user/documents/16_Geneva/wg11/JVET-P2001-v14.zip

The latest reference software of VVC, named VVC Test Model (VTM), could be found at: https://vcgit.hhi.fraunhofer.de/jvet/VVCSoftware_ VTM/tags/VTM-7.0.

2.1. Adaptive Colour Transform (ACT) in HEVC-SCC

The Adaptive Colour Transform (ACT) was adopted into the HEVC Screen Content Coding (SCC) test model 2 at the 18^(th) JCT-VC meeting (June 30^(th) to July 9^(th), 2014, Sapporo, Japan). ACT performs in-loop colour space conversion in the prediction residual domain using colour transform matrices based on the YCoCg and YCoCg-R colour spaces. ACT is turned on or off adaptively at the CU level using the flag cu_residual_act_flag. ACT can be combined with Cross Component Prediction (CCP), which is another inter component de-correlation method already supported in HEVC. When both are enabled, ACT is performed after CCP at the decoder, as shown in FIG. 1 .

2.1.1. Colour Space Conversion in ACT

The colour space conversion in ACT is based on the YCoCg-R transform. Both lossy coding and lossless coding (cu_transquant_bypass_flag = 0 or 1) use the same inverse transform, but an additional 1-bit left shift is applied to the Co and Cg components in the case of lossy coding. Specifically, the following colour space transforms are used for forward and backward conversion for lossy and lossless coding: Forward transform for lossy coding (non-normative):

$\begin{bmatrix} Y \\ {Co} \\ {Cg} \end{bmatrix} = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 0 & {- 2} \\ {- 1} & 2 & {- 1} \end{bmatrix}\begin{bmatrix} R \\ G \\ {CB} \end{bmatrix}/4$

Forward transform for lossless coding (non-normative):

$\begin{matrix} {Co} \\ t \\ {Cg} \\ Y \end{matrix}\begin{matrix}  = \\  = \\  = \\  =  \end{matrix}\begin{matrix} {R - B} \\ {B + \left( {Co > > 1} \right)} \\ \left( {G - t} \right) \\ {t + \left( {Cg > > 1} \right)} \end{matrix}$

Backward transform (normative): if (lossy ){

$\begin{array}{l} {Co = Co < < 1} \\ {Cg = Cg < < 1} \\ \} \\ \begin{array}{lll} t & = & {Y - \left( {Cg > > 1} \right)} \\ G & = & {Cg + t} \\ B & = & {t - \left( {Co > > 1} \right)} \\ R & = & {Co + b} \end{array} \end{array}$

The forward colour transform is not normalized, with its norm being roughly equal to √6/4 for Y and Cg and equal to √2/2 for Co. In order to compensate for the non-normalized nature of the forward transform, delta QPs of (-5, -3, -5) are applied to (Y, Co, Cg), respectively. In other words, for a given “normal” QP for the CU, if ACT is turned on, then the quantization parameter is set equal to (QP - 5, QP - 3, QP -5) for (Y, Co, Cg), respectively. The adjusted quantization parameter only affects the quantization and inverse quantization of the residuals in the CU. For deblocking, the “normal” QP value is still used. Clipping to 0 is applied to the adjusted QP values to ensure that they will not become negative. Note that this QP adjustment is only applicable to lossy coding, as quantization is not performed in lossless coding (cu_transquant_bypass_flag=1). In SCM 4, PPS/slice-level signaling of additional QP offset values is introduced. These QP offset values may be used instead of (-5, -3, -5) for CUs when adaptive colour transform is applied.

When the input bit-depths of the colour components are different, appropriate left shifts are applied to align the sample bit-depths to the maximal bit-depth during ACT, and appropriate right shifts are applied to restore the original sample bit-depths after ACT.

2.2. ACT in VVC

FIG. 2 illustrates the decoding flowchart of VVC with the ACT be applied. As illustrated in FIG. 2 , the colour space conversion is carried out in residual domain. Specifically, one additional decoding module, namely inverse ACT, is introduced after inverse transform to convert the residuals from YCgCo domain back to the original domain.

In the VVC, unless the maximum transform size is smaller than the width or height of one coding unit (CU), one CU leaf node is also used as the unit of transform processing. Therefore, in the proposed implementation, the ACT flag is signaled for one CU to select the colour space for coding its residuals. Additionally, following the HEVC ACT design, for inter and IBC CUs, the ACT is only enabled when there is at least one non-zero coefficient in the CU. For intra CUs, the ACT is only enabled when chroma components select the same intra prediction mode of luma component, i.e., derived mode (DM).

The core transforms used for the colour space conversions are kept the same as that used for the HEVC. Additionally, same with the ACT design in HEVC, to compensate the dynamic range change of residuals signals before and after colour transform, the QP adjustments of (-5, -5, -3) are applied to the transform residuals.

On the other hand, the forward and inverse colour transforms may access the residuals of all three components. Correspondingly, in the proposed implementation, the ACT may be disabled in the following two scenarios where not all residuals of three components are available.

1. Separate-tree partition: when separate-tree is applied, luma and chroma samples inside one CTU are partitioned by different structures. This results in that the CUs in the luma-tree only contains luma component and the CUs in the chroma-tree only contains two chroma components.

2. Intra sub-partition prediction (ISP): the ISP sub-partition is only applied to luma while chroma signals are coded without splitting. In the current ISP design, except the last ISP sub-partitions, the other sub-partitions only contain luma component.

The texts of a coding unit in the VVC draft are shown as below.

coding_unit( x0, y0, cbWidth, cbHeight, cqtDepth, treeType, modeType ) { Descriptor chType = treeType = = DUAL_TREE_CHROMA ? 1 : 0 if( slice_type != I | | sps_ibc_enabled_flag ) { if( treeType != DUAL_TREE_CHROMA && ( ( !( cbWidth = = 4 && cbHeight = = 4 ) && modeType != MODE_TYPE_INTRA ) | | ( sps_ibc_enabled_flag && cbWidth <= 64 && cbHeight <= 64 ) ) ) cu_skip_flag[ x0 ][ y0 ] ae(v) if( cu_skip_flag[ x0 ][ y0 ] == 0 && slice_type != I && !( cbWidth = = 4 && cbHeight == 4 ) && modeType = = MODE_TYPE_ALL ) pred_mode_flag ae(v) if( ( ( slice_type == I && cu_skip_flag[ x0 ][ y0 ] = =0 ) | | ( slice_type != I && ( CuPredMode[ chType ][ x0 ][ y0 ] != MODE_INTRA | | ( ( ( cbWidth = = 4 && cbHeight = = 4 ) || modeType = = MODE_TYPE_INTRA ) && cu_skip_flag[ x0 ][ y0 ] = = 0 ) ) ) ) && cbWidth <= 64 && cbHeight <= 64 && modeType != MODE_TYPE_INTER && sps_ibc_enabled_flag && treeType != DUAL_TREE_CHROMA ) pred_mode_ibc_flag ae(v) } if( CuPredMode[ chType ][ x0 ][ y0 ] == MODE_INTRA && sps_palette_enabled_flag && cbWidth <= 64 && cbHeight <= 64 && cu_skip_flag[ x0 ][ y0 ] = = 0 && modeType != MODE_TYPE_INTER ) pred_mode_pit_flag ae(v) } if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA && sps_act_enabled_flag && treeType = = SINGLE_TREE) cu_act_enabled_flag if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA | | CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_PLT ) { if( treeType = = SINGLE_TREE | | treeType = = DUAL_TREE_LUMA ) { if( pred_mode_pit_flag ) { palette_coding( x0, y0, cbWidth, cbHeight, treeType ) } else { if( sps_bdpcm_enabled_flag && cbWidth <= MaxTsSize && cbHeight <= MaxTsSize ) intra_bdpcm_luma_flag ae(v) if( intra_bdpcm_luma_flag ) intra_bdpcm_luma_dir_flag ae(v) else { if( sps_mip_enabled_flag ) intra_mip_flag[ x0 ][ y0 ] ae(v) if( intra_mip_flag[ x0 ][ y0 ] ) { intra_mip_transposed[ x0 ][ y0 ] ae(v) intra_mip_mode[ x0 ][ y0 ] ae(v) } else { if( sps_mrl_enabled_flag && ( ( y0 % CtbSizeY ) > 0 ) ) intra_luma_ref_idx[ x0 ][ y0 ] ae(v) if( sps_isp_enabled_flag && intra_luma_ref_idx[ x0 ][ y0 ] = = 0 && ( cbWidth <= MaxTbSizeY && cbHeight <= MaxTbSizeY ) && ( cbWidth * cbHeight > MinTbSizeY * N MinTbSizeY ) && !cu_act_enabled_flag ) intra_subpartitions_mode_flag[ x0 ][ y0 ] ae(v) if( intra_subpartitions_mode_flag[ x0 ][ y0 ] = = 1 ) intra_subpartitions_split_flag[ x0 ][ y0 ] ae(v) if( intra_luma_ref_idx[ x0 ][ y0 ] = = 0 ) intra_luma_mpm_flag[ x0 ][ y0 ] ae(v) if( intra_luma_mpm_flag[ x0 ][ y0 ] ) { if( intra_luma_ref_idx[ x0 ][ y0 ] = = 0 ) intra_luma_not_planar_flag[ x0 ][ y0 ] ae(v) if( intra_luma_not_planar_flag[ x0 ][ y0 ] ) intra_luma_mpm_idx[ x0 ][ y0 ] ae(v) } else intra_luma_mpm_remainder[ x0 ][ y0 ] ae(v) } } } } if( ( treeType = = SINGLE_TREE | | treeType = = DUAL_TREE_CHROMA ) && ChromaArrayType != 0 ) { if( pred_mode_pit_flag && treeType = = DUAL_TREE_CHROMA ) palette_coding( x0, y0, cbWidth / SubWidthC, cbHeight / SubHeightC, treeType ) else { if( !cu_act_enabled_flag ) { if( cbWidth <= MaxTsSize && cbHeight <= MaxTsSize && sps_bdpcm_chroma_enabled_flag ) { intra_bdpcm_chroma_flag ae(v) if( intra_bdpcm_chroma_flag ) intra_bdpcm_chroma_dir_flag ae(v) } else { if( CclmEnabled ) cclm_mode_flag ae(v) if( cclm_mode_flag ) cclm_mode_idx ae(v) else intra_chroma_pred_mode ae(v) } } } } } else if( treeType != DUAL_TREE_CHROMA ) { /* MODE_INTER or MODE_IBC */ if( cu_skip_flag[ x0 ][ y0 ] = = 0 ) general_merge_flag[ x0 ][ y0 ] ae(v) if( general_merge_flag[ x0 ][ y0 ] ) merge_data( x0, y0, cbWidth, cbHeight, chType ) else if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_IBC ) { mvd_coding( x0, y0, 0, 0 ) if( MaxNumIbcMergeCand > 1 ) mvp_10_flag[ x0 ][ y0 ] ae(v) if( sps_amvr_enabled_flag && ( MvdL0[ x0 ][ y0 ][ 0 ] != 0 | | MvdL0[ x0 ][ y0 ][ 1 ] != 0 ) ) amvr_precision_idx[ x0 ][ y0 ] ae(v) } else { if( slice_type = = B ) inter_pred_idc[ x0 ][ y0 ] ae(v) if( sps_affine_enabled_flag && cbWidth >= 16 && cbHeight >= 16 ) { inter_affine_flag[ x0 ][ y0 ] ae(v) if( sps_affine_type_flag && inter_affine_flag[ x0 ][ y0 ] ) cu_affine_type_flag[ x0 ][ y0 ] ae(v) } if( sps_smvd_enabled_flag && !mvd_11_zero_flag && inter_pred_idc[ x0 ][ y0 ] = = PRED_BI && linter_affine_flag[ x0 ][ y0 ] && RefIdxSymL0 > -1 && RefIdxSymL1 > -1 ) sym_mvd_flag[ x0 ][ y0 ] ae(v) if( inter_pred_idc[ x0 ][ y0 ] != PRED_L1 ) { if( NumRefIdxActive[ 0 ] > 1 && !sym_mvd_flag[ x0 ][ y0 ] ) ref_idx_10[ x0 ][ y0 ] ae(v) mvd_coding( x0, y0, 0, 0 ) if( MotionModelIdc[ x0 ][ y0 ] > 0 ) mvd_coding( x0, y0, 0, 1 ) if(MotionModelIdc[ x0 ][ y0 ] > 1 ) mvd_coding( x0, y0, 0, 2 ) mvp_10_flag[ x0 ][ y0 ] ae(v) } else { MvdL0[ x0 ][ y0 ][ 0 ] = 0 MvdL0[ x0 ][ y0 ][ 1 ] = 0 } if( inter_pred_idc[ x0 ][ y0 ] != PRED_L0 ) { if( NumRefIdxActive[ 1 ] > 1 && !sym_mvd_flag[ x0 ][ y0 ] ) ref_idx_11[ x0 ][ y0 ] ae(v) if( mvd_11_zero_flag && inter_pred_idc[ x0 ][ y0 ] = = PRED_BI ) { MvdL1[ x0 ][ y0 ][ 0 ] = 0 MvdL1[ x0 ][ y0 ][ 1 ] =0 MvdCpL1[ x0 ][ y0 ][ 0 ][ 0 ] =0 MvdCpL1[ x0 ][ y0 ][ 0 ][ 1 ] = 0 MvdCpL1[ x0 ][ y0 ][ 1 ][ 0 ] = 0 MvdCpL1[ x0 ][ y0 ][ 1 ][ 1 ] = 0 MvdCpL1[ x0 ][ y0 ][ 2 ][ 0 ] = 0 MvdCpL1[ x0 ][ y0 ][ 2 ][ 1 ] = 0 } else { if( sym_mvd_flag[ x0 ][ y0 ] ) { MvdL1[ x0 ][ y0 ][ 0 ] = -MvdL0[ x0 ][ y0 ][ 0 ] MvdL1[ x0 ][ y0 ][ 1 ] = -MvdL0[ x0 ][ y0 ][ 1 ] } else mvd_coding( x0, y0, 1, 0 ) if( MotionModelIdc[ x0 ][ y0 ] > 0 ) mvd_coding( x0, y0, 1, 1 ) if(MotionModelIdc[ x0 ][ y0 ] > 1 ) mvd_coding( x0, y0, 1, 2 ) } mvp_11_flag[ x0 ][ y0 ] ae(v) } else { MvdL1[ x0 ][ y0 ][ 0 ] = 0 MvdL1[ x0 ][ y0 ][ 1 ] = 0 } if( ( sps_amvr_enabled_flag && inter_affine_flag[ x0 ][ y0 ] = = 0 && ( MvdL0[ x0 ][ y0 ][ 0 ] != 0 | | MvdL0[ x0 ][ y0 ][ 1 ] != 0 | | MvdL1[ x0 ][ y0 ][ 0 ]!= 0 | | MvdL1[ x0 ][ y0 ][ 1 ] != 0 ) ) | | ( sps_affine_amvr_enabled_flag && inter_affine_flag[ x0 ][ y0 ] = = 1 && ( MvdCpL0[ x0 ][ y0 ][ 0 ][ 0 ] != 0 | | MvdCpL0[ x0 ][ y0 ][ 0 ][ 1 ] != 0 | | MvdCpL1[ x0 ][ y0 ][ 0 ][ 0 ] != 0 | | MvdCpL1[ x0 ][ y0 ][ 0 ][ 1 ] != 0 | | MvdCpL0[ x0 ][ y0 ][ 1 ][ 0 ] != 0 | | MvdCpL0[ x0 ][ y0 ][ 1 ][ 1 ] != 0 | | MvdCpL1[ x0 ][ y0 ][ 1 ][ 0 ] != 0 | | MvdCpL1[ x0 ][ y0 ][ 1 ][ 1 ] != 0 | | MvdCpL0[ x0 ][ y0 ][ 2 ][ 0 ] != 0 | | MvdCpL0[ x0 ][ y0 ][ 2 ][ 1 ] != 0 | | MvdCpL1[ x0 ][ y0 ][ 2 ][ 0 ] != 0 | | MvdCpL1[ x0 ][ y0 ][ 2 ][ 1 ] != 0 ) ) { amvr_flag[ x0 ][ y0 ] ae(v) if( amvr_flag[ x0 ][ y0 ] ) amvr_precision_idx[ x0 ][ y0 ] ae(v) } if( sps_bcw_enabled_flag && inter_pred_idc[ x0 ][ y0 ] = = PRED_BI && luma_weight_10_flag[ ref_idx_10 [ x0 ][ y0 ] ] == 0 && luma_weight_11_flag[ ref_idx_11 [ x0 ][ y0 ] ] = = 0 && chroma_weight_10_flag[ ref-idx_10 [ x0 ][ y0 ] ] = = 0 && chroma_weight_11_flag[ ref_idx_11 [ x0 ][ y0 ] ] = = 0 && cbWidth * cbHeight >= 256 ) bcw_idx[ x0 ][ y0 ] ae(v) } } if( CuPredMode[ chType ][ x0 ][ y0 ] != MODE_INTRA && !pred_mode_pit_flag && general_merge_flag[ x0 ][ y0 ] = = 0 ) cu_cbf ae(v) if( cu_cbf ) { if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTER && sps_sbt_enabled_flag && !ciip_flag[ x0 ][ y0 ] && !MergeTriangleFlag[ x0 ][ y0 ] && cbWidth <= MaxTbSizeY && cbHeight <= MaxTbSizeY ) { allowSbtVerH = cbWidth >= 8 allowSbtVerQ = cbWidth >= 16 allowSbtHorH = cbHeight >= 8 allowSbtHorQ = cbHeight >= 16 if( allowSbtVerH | | allowSbtHorH ) cu_sbt_flag ae(v) if( cu_sbt_flag ) { if( ( allowSbtVerH | | allowSbtHorH ) && ( allowSbtVerQ | | allowSbtHorQ ) ) cu_sbt_quad_flag ae(v) if( ( cu_sbt_quad_flag && allowSbtVerQ && allowSbtHorQ ) | | ( !cu_sbt_quad flag && allowSbtVerH && allowSbtHorH ) ) cu_sbt_horizontal_flag ae(v) cu_sbt_pos_flag ae(v) } } if( sps_act_enabled_flag && CuPredMode[ chType ][ x0 ][ y0 ] != MODE_INTRA && tree Type = = SINGLE_TREE ) cu_act_enabled_flag ae(v) LfnstDcOnly = 1 LfnstZeroOutSigCoeffFlag = 1 MtsZeroOutSigCoeffFlag = 1 transform_tree( x0, y0, cbWidth, cbHeight, treeType, chType ) lfnstWidth = ( treeType = = DUAL_TREE_CHROMA ) ? cbWidth / SubWidthC : ( ( IntraSubPartitionsSplitType = = ISP_VER_SPLIT ) ? cbWidth / NumIntraSubPartitions : cb Width) lfnstHeight = ( treeType = = DUAL_TREE_CHROMA ) ? cbHeight / SubHeightC : ( ( IntraSubPartitionsSplitType = = ISP_HOR_SPLIT) ? cbHeight / NumIntraSubPartitions : cbHeight) if( Min( lfnstWidth, lfnstHeight ) >= 4 && sps_lfnst_enabled_flag = = 1 && CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA && transform_skip_flag[ x0 ][ y0 ][ 0 ] = = 0 && ( treeType != DUAL_TREE_CHROMA | | !intra mip_flag[ x0 y0 ] | | Min( lfnstWidth, lfnstHeight ) >= 16 && Max( cbWidth, cbHeight ) <= MaxTbSizeY) { if( ( IntraSubPartitionsSplitType != ISP_NO_SPLIT | | LfnstDcOnly = = 0 ) && LfnstZeroOutSigCoeffFlag = = 1 ) Ifnst_idx ae(v) } if( treeType != DUAL_TREE_CHROMA && lfnst_idx = = 0 && transform_skip_flag[ x0 ][ y0 ][ 0 ] = = 0 && Max( cbWidth, cbHeight ) <= 32 && IntraSubPartitionsSplit[ x0 ][ y0 ] = = ISP_NO_SPLIT && cu_sbt_flag = = 0 && MtsZeroOutSigCoeffFlag = = 1 && tu_cbf_luma[ x0 ][ y0 ] ) { if( ( ( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTER && sps_explicit_mts_inter_enabled_flag ) || ( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA && sps_explicit_mts_intra_enabled_flag ) ) ) mts_idx ae(v) } } cu_act_enabled_flag equal to 1 specifies that the residuals of the current coding unit are coded in YC_(g)C_(o) colour space. cu_act_enabled_flag equal to 0 specifies that the residuals of the current coding unit are coded in original colour space. When cu_act_enabled_flag is not present, it is inferred to be equal to 0.

2.3. Transform Skip Mode in VVC

As in HEVC, the residual of a block can be coded with transform skip mode which completely skips the transform process for a block. In addition, for transform skip blocks, a minimum allowed Quantization Parameter (QP) signaled in SPS is used, which is set equal to 6*(internalBitDepth - inputBitDepth) + 4 in VTM7.0.

2.4. Block-based Delta Pulse Code Modulation (BDPCM)

In JVET-M0413, a block-based Delta Pulse Code Modulation (BDPCM) is proposed to code screen contents efficiently and then adopted into VVC.

The prediction directions used in BDPCM can be vertical and horizontal prediction modes. The intra prediction is done on the entire block by sample copying in prediction direction (horizontal or vertical prediction) similar to intra prediction. The residual is quantized and the delta between the quantized residual and its predictor (horizontal or vertical) quantized value is coded. This can be described by the following: For a block of size M (rows) × N (cols), let r_(i,j), 0 ≤ i ≤ M - 1, 0 ≤ j ≤ N - 1 be the prediction residual after performing intra prediction horizontally (copying left neighbor pixel value across the predicted block line by line) or vertically (copying top neighbor line to each line in the predicted block) using unfiltered samples from above or left block boundary samples. Let Q (r_(i,j)), 0 ≤ i ≤ M - 1, 0 ≤ j ≤ N - 1 denote the quantized version of the residual r_(i,j), where residual is difference between original block and the predicted block values. Then the block DPCM is applied to the quantized residual samples, resulting in modified M × N array R with elements r_(i,j). When vertical BDPCM is signaled:

${\widetilde{r}}_{i,j} = \left\{ \begin{matrix} {Q\left( r_{i,j} \right),} & {i = 0,\mspace{6mu} 0 \leq j \leq \left( {N - 1} \right)} \\ {Q\left( r_{i,j} \right) - Q\left( r_{{({i - 1})},j} \right),} & {1 \leq i \leq \left( {M - 1} \right),\mspace{6mu} 0 \leq j \leq \left( {N - 1} \right)} \end{matrix} \right).$

For horizontal prediction, similar rules apply, and the residual quantized samples are obtained by

${\widetilde{r}}_{i,j} = \left\{ \begin{matrix} {Q\left( r_{i,j} \right),} & {\mspace{6mu} 0 \leq i \leq \left( {M - 1} \right),j = 0} \\ {Q\left( r_{i,j} \right) - Q\left( r_{i,{({j - 1})}} \right),} & {0 \leq i \leq \left( {M - 1} \right),\mspace{6mu} 1 \leq j \leq \left( {N - 1} \right)} \end{matrix} \right).$

The residual quantized samples r_(i,j) are sent to the decoder.

On the decoder side, the above calculations are reversed to produce Q(,r_(i,j)), 0 ≤ i ≤ M-1, 0 ≤ j ≤ N - 1.

For vertical prediction case,

$Q\left( r_{i,j} \right) = {\sum_{k = 0}^{i}{{\widetilde{r}}_{k,j},\mspace{6mu}}}0 \leq i \leq \left( {M - 1} \right),\mspace{6mu} 0 \leq j \leq \left( {N - 1} \right).$

For horizontal case,

$Q\left( r_{i,j} \right) = {\sum_{k = 0}^{j}{{\widetilde{r}}_{i,k},\mspace{6mu}}}0 \leq i \leq \left( {M - 1} \right),\mspace{6mu} 0 \leq j \leq \left( {N - 1} \right).$

The inverse quantized residuals, Q⁻¹ (Q(r_(i,j))), are added to the intra block prediction values to produce the reconstructed sample values.

The main benefit of this scheme is that the inverse BDPCM can be done on the fly during coefficient parsing simply adding the predictor as the coefficients are parsed or it can be performed after parsing.

In VTM7.0, the BDPCM also can be applied on chroma blocks and the chroma BDPCM has a separate flag and BDPCM direction from the luma BDPCM mode.

2.5. Scaling Process for Transform Coefficients

The texts related to scaling process for transform coefficents in JVET-P2001-vE is given as follows.

Inputs to this process are:

-   a luma location ( xTbY, yTbY ) specifying the top-left sample of the     current luma transform block relative to the top-left luma sample of     the current picture, -   a variable nTbW specifying the transform block width, -   a variable nTbH specifying the transform block height, -   a variable predMode specifying the prediction mode of the coding     unit, -   a variable cIdx specifying the colour component of the current     block.

Output of this process is the (nTbW)x(nTbH) array d of scaled transform coefficients with elements d[ x ] [ y ].

The quantization parameter qP is derived as follows:

-   If cIdx is equal to 0, the following applies: -   $\begin{matrix}     \text{qP = Qp'}_{\text{Y}} & \text{­­­(1129)}     \end{matrix}$ -   Otherwise, if TuCResMode[ xTbY ][ yTbY] is equal to 2, the following     applies: -   $\begin{matrix}     \text{qP = Qp'}_{\text{CbCr}} & \text{­­­(1130)}     \end{matrix}$ -   Otherwise, if cIdx is equal to 1, the following applies: -   $\begin{matrix}     \text{qP = Qp'}_{\text{Cb}} & \text{­­­(1131)}     \end{matrix}$ -   Otherwise (cIdx is equal to 2), the following applies: -   $\begin{matrix}     \text{qP = Qp'}_{\text{Cr}} & \text{­­­(1132)}     \end{matrix}$

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[ xTbY ] [ yTbY ][ cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     {\text{qP = qP} - \left( {\text{cu\_act\_enabled\_flag}\left\lbrack \text{xTbY} \right\rbrack\left\lbrack \text{yTbY} \right\rbrack?5:0} \right)} & \text{­­­(1133)}     \end{matrix}$ -   $\begin{matrix}     {\text{rectNonTsFlag =}\left( {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right) = \mspace{6mu} = 1} \right)?\mspace{6mu} 1:0} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = BitDepth + rectNonTsFlag +} & \text{­­­(1135)}     \end{matrix}$ -   ( ( Log2( nTbW) + Log2( nTbH ) ) / 2 ) - 5 +     pic_dep_quant_enabled_flag -   Otherwise (transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to     1), the following applies: -   $\begin{matrix}     {\text{qP = Max}\left( \text{QpPrimeTsMin, qP} \right) - \left( {\text{cu\_act\_enabled\_flag}\left\lbrack \text{xTbY} \right\rbrack\left\lbrack \text{yTbY} \right\rbrack?\mspace{6mu} 5:0} \right)} & \text{­­­(1136)}     \end{matrix}$ -   $\begin{matrix}     \text{rectNoonTsFlag = 0} & \text{­­­(1137)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = 10} & \text{­­­(1138)}     \end{matrix}$

The variable bdOffset is derived as follows:

$\begin{matrix} {\text{bdOffset =}\left( {1 < < \text{bdShift}} \right) > > 1} & \text{­­­(1139)} \end{matrix}$

The list levelScale[ ][ ] is specified as levelScale[ j ][ k] = { { 40, 45, 51, 57, 64, 72 }, { 57, 64, 72, 80, 90, 102 } } with j = 0..1, k = 0..5.

The (nTbW)x(nTbH) array dz is set equal to the (nTbW)x(nTbH) array TransCoeffLevel[ xTbY ][ yTbY ][ cIdx ].

For the derivation of the scaled transform coefficients d[ x ][ y ] with x = 0..nTbW - 1, y = 0..nTbH - 1, the following applies:

-   The intermediate scaling factor m[ x ][ y ] is derived as follows:     -   If one or more of the following conditions are true, m[ x ][ y ]         is set equal to 16:         -   sps_scaling_list_enabled_flag is equal to 0.         -   pic_scaling_list_present_flag is equal to 0.         -   transform_skip_flag[ xTbY ] [ yTbY ][ cIdx ] is equal to 1.         -   scaling_matrix_for_lfnst_disabled_flag is equal to 1 and             1fnst_idx[ xTbY ] [ yTbY ] is not equal to 0.     -   Otherwise, the following applies:         -   The variable id is derived based on predMode, cIdx, nTbW,             and nTbH as specified in Table 36 and the variable             log2MatrixSize is derived as follows:         -   $\begin{matrix}             {\text{log2MatrixSize =}\left( \text{id < 2} \right)?\mspace{6mu} 1:\left( \text{id < 8} \right)?\mspace{6mu} 2:3} & \text{­­­(1140)}             \end{matrix}$         -   The scaling factor m[ x ][ y ] is derived as follows:         -   $\begin{matrix}             \begin{matrix}             {\text{m}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \text{ScalingMatrixRec}\left\lbrack \text{id} \right\rbrack\left\lbrack \text{i} \right\rbrack\left\lbrack \text{j} \right\rbrack} \\             {\text{with i =}\left( \text{x << log2MatrixSize} \right) > > \text{Log2}\left( \text{nTbW} \right),} \\             {\text{j =}\left( \text{y << log2MatrixSize} \right) > > \text{Log2}\left( \text{nTbW} \right)}             \end{matrix} & \text{­­­(1141)}             \end{matrix}$         -   If id is greater than 13 and both x and y are equal to 0, m[             0 ] [ 0 ] is further modified as follows:         -   $\begin{matrix}             {\text{m}\lbrack 0\rbrack\lbrack 0\rbrack = \mspace{6mu}\text{ScalingMatrixDCRec}\left\lbrack {\text{id} - 14} \right\rbrack} & \text{­­­(1142)}             \end{matrix}$         -   NOTE - A quantization matrix element m[ x ] [ y ] can be             zeroed out when any of the following conditions is true     -   x is greater than 32     -   y is greater than 32     -   The decoded tu is not coded by default transform mode (i.e.         transform type is not equal to 0) and x is greater than 16     -   The decoded tu is not coded by default transform mode (i.e.         transform type is not equal to 0 ) and y is greater than 16 -   The scaling factor 1 s[ x ][ y ] is derived as follows:     -   If pic_dep_quant_enabled_flag is equal to 1 and         transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to 0, the         following applies:     -   $\begin{matrix}         \begin{array}{l}         {\text{ls}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \left( {\text{m}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack*\text{levelScale}\left\lbrack \text{rectNonTsFlag} \right\rbrack\left\lbrack {\left( \text{qP+1} \right)\%\mspace{6mu} 6} \right\rbrack} \right)} \\         {< < \left( {\left( \text{qP+1} \right)/6} \right)}         \end{array} & \text{­­­(1143)}         \end{matrix}$     -   Otherwise (pic_dep_quant_enabled_flag is equal to 0 or         transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to 1), the         following applies:     -   $\begin{matrix}         \begin{array}{l}         {\text{ls}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \left( {\text{m}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack*\text{levelScale}\left\lbrack \text{rectNonTsFlag} \right\rbrack\left\lbrack {\text{qP}\%\mspace{6mu} 6} \right\rbrack} \right)} \\         {< < \left( {\text{qP}/6} \right)}         \end{array} & \text{­­­(1144)}         \end{matrix}$ -   When BdpcmFlag[ xTbY ][ yYbY][ cIdx ] is equal to 1, dz[ x ][ y ] is     modified as follows:     -   If BdpcmDir[ xTbY ][ yYbY ][ cIdx ] is equal to 0 and x is         greater than 0, the following applies:     -   $\begin{matrix}         {\text{dz}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \text{Clip3}\left( {\text{CoeffMin, CoeffMax, dz}\left\lbrack {\text{x} - 1} \right\rbrack\left\lbrack \text{y} \right\rbrack + \text{dz}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack} \right)} & \text{­­­(1145)}         \end{matrix}$     -   Otherwise, if BdpcmDir[ xTbY ] [ yTbY ][ cIdx ] is equal to 1         and y is greater than 0, the following applies:     -   $\begin{matrix}         {\text{dz}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \text{Clip3}\left( {\text{CoeffMin, CoeffMax, dz}\left\lbrack \text{x} \right\rbrack\left\lbrack {\text{y} - 1} \right\rbrack + \text{dz}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack} \right)} & \text{­­­(1146)}         \end{matrix}$ -   The value dnc[ x ][ y ] is derived as follows: -   $\begin{matrix}     {\text{dnc}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \left( {\text{dz}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack*\text{ls}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack + \text{bdOffset}} \right) > > \text{bdShift}} & \text{­­­(1147)}     \end{matrix}$ -   The scaled transform coefficient d[ x ][ y ] is derived as follows: -   $\begin{matrix}     {\text{d}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \text{Clip3}\left( {\text{CoeffMin, CoeffMax, dnc}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack} \right)} & \text{­­­(1148)}     \end{matrix}$

TABLE 36 Specification of the scaling matrix identifier variable id according to predMode, cIdx, nTbW, and nTbH max( nTbW, nTbH ) 2 4 8 16 32 64 predMode = MODE_INTRA cIdx = 0 (Y) 2 8 14 20 26 cIdx = 1 (Cb) 3 9 15 21 21 cIdx = 2 (Cr) 4 10 16 22 22 predMode = MODE_INTER (INTER, IBC) cIdx = 0 (Y) 5 11 17 23 27 cIdx = 1 (Cb) 0 6 12 18 24 24 cIdx = 2 (Cr) 1 7 13 19 25 25

2.6. Palette Mode 2.6.1. Concept of Palette Mode

The basic idea behind a palette mode is that the pixels in the CU are represented by a small set of representative colour values. This set is referred to as the palette. And it is also possible to indicate a sample that is outside the palette by signaling an escape symbol followed by (possibly quantized) component values. This kind of pixel is called escape pixel. The palette mode is illustrated in FIG. 3 . As depicted in FIG. 3 , for each pixel with three colour components (luma, and two chroma components), an index to the palette is founded, and the block could be reconstructed based on the founded values in the palette.

2.6.2. Coding of the Palette Entries

For coding of the palette entries, a palette predictor is maintained. The maximum size of the palette as well as the palette predictor is signaled in the SPS. In HEVC-SCC, a palette_predictor_initializer_present_flag is introduced in the PPS. When this flag is 1, entries for initializing the palette predictor are signaled in the bitstream. The palette predictor is initialized at the beginning of each CTU row, each slice and each tile. Depending on the value of the palette_predictor_initializer_present_flag, the palette predictor is reset to 0 or initialized using the palette predictor initializer entries signaled in the PPS. In HEVC-SCC, a palette predictor initializer of size 0 was enabled to allow explicit disabling of the palette predictor initialization at the PPS level.

For each entry in the palette predictor, a reuse flag is signaled to indicate whether it is part of the current palette. This is illustrated in FIG. 4 . The reuse flags are sent using run-length coding of zeros. After this, the number of new palette entries are signaled using Exponential Golomb (EG) code of order 0, i.e., EG-0. Finally, the component values for the new palette entries are signaled.

2.6.3. Coding of Palette Indices

The palette indices are coded using horizontal and vertical traverse scans as shown in FIG. 5 . The scan order is explicitly signaled in the bitstream using the palette_transpose_flag. For the rest of the subsection it is assumed that the scan is horizontal.

The palette indices are coded using two palette sample modes: ‘COPY_LEFT’ and ‘COPY_ABOVE’. In the ‘COPY_LEFT’ mode, the palette index is assigned to a decoded index. In the ‘COPY_ABOVE’ mode, the palette index of the sample in the row above is copied. For both ’COPY_LEFT’ and ‘COPY_ABOVE’ modes, a run value is signaled which specifies the number of subsequent samples that are also coded using the same mode.

In the palette mode, the value of an index for the escape symbol is the number of palette entries. And, when escape symbol is part of the run in ‘COPY_LEFT’ or ‘COPY_ABOVE’ mode, the escape component values are signaled for each escape symbol. The coding of palette indices is illustrated in FIG. 6 .

This syntax order is accomplished as follows. First the number of index values for the CU is signaled. This is followed by signaling of the actual index values for the entire CU using truncated binary coding. Both the number of indices as well as the index values are coded in bypass mode. This groups the index-related bypass bins together. Then the palette sample mode (if necessary) and run are signaled in an interleaved manner. Finally, the component escape values corresponding to the escape symbols for the entire CU are grouped together and coded in bypass mode. The binarization of escape symbols is EG coding with 3rd order, i.e., EG-3.

An additional syntax element, last_run_type_flag, is signaled after signaling the index values. This syntax element, in conjunction with the number of indices, eliminates the need to signal the run value corresponding to the last run in the block.

In HEVC-SCC, the palette mode is also enabled for 4:2:2, 4:2:0, and monochrome chroma formats. The signaling of the palette entries and palette indices is almost identical for all the chroma formats. In case of non-monochrome formats, each palette entry consists of 3 components. For the monochrome format, each palette entry consists of a single component. For subsampled chroma directions, the chroma samples are associated with luma sample indices that are divisible by 2. After reconstructing the palette indices for the CU, if a sample has only a single component associated with it, only the first component of the palette entry is used. The only difference in signaling is for the escape component values. For each escape symbol, the number of escape component values signaled may be different depending on the number of components associated with that symbol.

2.6.4. Palette in Dual Tree

In VVC, the dual tree coding structure is used on coding the intra slices, so the luma component and two chroma components may have different palette and palette indices. In addition, the two chroma component shares same palette and palette indices.

2.6.5. Line Based CG Palette Mode

Line based CG palette mode was adopted to VVC. In this method, each CU of palette mode is divided into multiple segments of m samples (m = 16 in this test) based on the traverse scan mode. The encoding order for palette run coding in each segment is as follows: For each pixel, 1 context coded bin run_copy_flag = 0 is signaled indicating if the pixel is of the same mode as the previous pixel, i.e., if the previous scanned pixel and the current pixel are both of run type COPY_ABOVE or if the previous scanned pixel and the current pixel are both of run type INDEX and the same index value. Otherwise, run_copy_flag = 1 is signaled. If the pixel and the previous pixel are of different mode, one context coded bin copy_above_palette_indices_flag is signaled indicating the run type, i.e., INDEX or COPY_ABOVE, of the pixel. Same as the palette mode in VTM6.0, decoder does not have to parse run type if the sample is in the first row (horizontal traverse scan) or in the first column (vertical traverse scan) since the INDEX mode is used by default. Also, the decoder does not have to parse run type if the previously parsed run type is COPY_ABOVE. After palette run coding of pixels in one segment, the index values (for INDEX mode) and quantized escape colours are bypass coded and grouped apart from encoding/parsing of context coded bins to improve throughput within each line CG. Since the index value is now coded/parsed after run coding, instead of processed before palette run coding as in VTM, encoder doesn’t have to signal the number of index values num_palette_indices_minus1 and the last run type copy_above_indices_for final_run_flag.

2.7. Picture Header and Slice Header

In this section, the newly added texts are highlight by bold italicized underlined text. The deleted texts are marked by italicized text.

The following text regarding picture parameter set, picture header and slice header are from the latest status of VVC HLS design with a few aspects different from JVET-P2001_vE, including the following two aspects:

-   1) Signaling of the collocated picture, which is in the PH when RPL     is in PH, and in SH when RPL is in SH -   2) Signaling of WP table, which is in the PH when RPL is in PH, and     in SH when RPL is SH

7.3.2.4 Picture parameter set RBSP syntax pic_parameter_set_rbsp( ) { Descriptor  pps_pic_parameter_set_id ue(v)  pps_seq_parameter_set_id u(4)  pic_width_in_luma_samples ue(v)  pic_height_in_luma_samples ue(v)  conformance_window_flag u(1)  if( conformance_window_flag ) {   conf_win_left_offset ue(v)   conf_win_right_offset ue(v)   conf_win_top_offset ue(v)   conf_win_bottom_offset ue(v)  }  scaling_window_flag u(1)  if( scaling_window_flag ) {   scaling_win_left_offset ue(v)   scaling_win_right_offset ue(v)   scaling_win_top_offset ue(v)   scaling_win_bottom_offset ue(v)  }  output_flag_present_flag u(1)  mixed_nalu_types_in_pic_flag u(1)  pps_subpic_id_signalling_present_flag u(1)  if( pps_subpic_id_signalling_present_flag ) {    pps_num_subpics_minus1 ue(v)    pps_subpic_id_len_minus1 ue(v)    for( i = 0; i <= pps_num_subpic_minus1; i++ )     pps_subpic_id[ i ] u(v)  }  no_pic_partition_flag u(1)  if( !no_pic_partition_flag ) {  pps_log2_ctu_size_minus5 u(2)   num_exp_tile_columns_minus1 ue(v)   num_exp_tile_rows_minus1 ue(v)   for( i = 0; i <= num_exp_tile_columns_minus 1; i++ )    tile_column_width_minus1[ i ] ue(v)   for( i = 0; i <= num_exp_tile_rows_minus1; i++ )    tile_row_height_minus1[ i ] ue(v)   rect_slice_flag u(1)   if( rect_slice_flag )    single_slice_per_subpic_flag u(1)   if( rect_slice_flag && !single_slice_per_subpic_flag ) {    num_slices_in_pic_minus1 ue(v)    tile_idx_delta_present_flag u(1)    for( i = 0; i < num_slices_in_pic_minus1; i++ ) {     slice_width_in_tiles_minus1[ i ] ue(v)     slice_height_in_tiles_minus1[ i ] ue(v)     if( slice_width_in_tiles_minus1[ i ]       = =     0        &&       slice_height_in_tiles_minus1[ i ] = = 0 ) {      num_slices_in_tile_minus1[ i ] ue(v)      for( j = 0; j < num_slices_in_tile_minus1[ i ]; j++ )       slice_height_in_ctu_minus1[ i++ ] ue(v)     }     if( tile_idx_delta_present_flag && i < num_slices_in_pic_minus1 )      tile_idx_delta[ i ] se(v)    }   }   loop_filter_across_tiles_enabled_flag u(1)   loop_filter_across_slices_enabled_flag u(1)  }  entropy_coding_sync_enabled_flag u(1)  if( !no_pic_partition_flag | | entropy_coding_sync_enabled_flag )   entry_point_offsets_present_flag u(1)  cabac_init_present_flag u(1)  for( i = 0; i < 2; i++ )   num_ref_idx_default_active_minus1[ i ] ue(v)  rpl1_idx_present_flag u(1)  init_qp_minus26 se(v)  log2_transform_skip_max_size_minus2 ue(v)  cu_qp_delta_enabled_flag u(1)  pps_cb_qp_offset se(v)  pps_cr_qp_offset se(v)  pps_joint_cber_qp_offset_present_flag u(1)  if( pps_joint_cber_qp_offset_present_flag )   pps_joint_cber_qp_offset_value se(v)  pps_slice_chroma_qp_offsets_present_flag u(1)  pps_cu_chroma_qp_offset_list_enabled_flag u(1)  if( pps_cu_chroma_qp_offset_list_enabled_flag ) {   chroma_qp_offset_list_len_minus1 ue(v)   for( i = 0; i <= chroma_qp_offset_list_len_minus1; i++ ) {    eb_qp_offset_list[ i ] se(v)    cr_qp_offset_list[ i ] se(v)    if( pps_joint_cber_qp_offset_present_flag )     joint_cber_qp_offset_list[ i ] se(v)   }  }  pps_weighted_pred_flag u(1)  pps_weighted_bipred_flag u(1)  deblocking_filter_control_present_flag u(1)  if( deblocking_filter_control_present_flag ) {   deblocking_filter_override_enabled_flag u(1)   pps_deblocking_filter_disabled_flag u(1)   if( !pps_deblocking_filter_disabled_flag ) {    pps_beta_offset_div2 se(v)    pps_tc_offset_div2 se(v)   }  }  rpl_info_in_ph_flag u(1)  if( deblocking_filter_override_enabled_flag )   dbf_info_in_ph_flag u(1)  sao_info_in_ph_flag u(1)  alf_info_in_ph_flag u(1)  constant_slice_header_params_enabled_flag u(1)  if( constant_slice_header_params_enabled_flag ) {   pps_dep_quant_enabled_idc u(2)   for( i = 0; i < 2; i++ )    pps_ref_pic_list_sps_idc[ i ] u(2)   pps_mvd_l1_zero_idc u(2)   pps_collocated_from_10_idc u(2)   pps_six_minus_max_num_merge_cand_plus1 ue(v)   pps_max_num_merge_cand_minus_max_num_triangle_cand_plus1 ue(v)  }  if( pps_weighted_pred_flag   | |   pps_weighted_bipred_flag   | | rpl_present_in_ph_flag )   wp_info_in_ph_flag u(1)  if( cu_qp_delta_enabled_flag )   qp_delta_info_in_ph_flag u(1)  picture_header_extension_present_flag u(1)  slice_header_extension_present_flag u(1)  pps_extension_flag u(1)  if( pps_extension_flag )   while( more_rbsp_data( ) )    pps_extension_data_flag u(1)  rbsp_trailing_bits( ) }

7.3.2.6 Picture header RBSP syntax picture_header_rbsp( ) { Descriptor  picture_header_structure( )  rbsp_trailing_bits( ) }

7.3.2.7 Picture header structure syntax picture_header_structure( ) { Descriptor  gdr_or_irap_pic_flag u(1)  if( gdr_or_irap_pic_flag )   gdr_pic_flag u(1)  pic_inter_slice_allowed_flag u(1)  if( pic_inter_slice_allowed_flag )   pic_intra_slice_allowed_flag u(1)  non_reference_picture_flag u(1)  ph_pic_parameter_set_id ue(v)  ph_pic_order_cnt_lsb u(v)  if( gdr_or_irap_pic_flag )   no_output_of_prior_pics_flag u(1)  if( gdr_pic_flag )   recovery_poc_cnt ue(v)  if( sps_poc_msb_flag ) {   ph_poc_msb_present_flag u(1)   if( ph_poc_msb_present_flag )    poc_msb_val u(v)  }  if( !sps_virtual_boundaries_present_flag ) {   ph_virtual_boundaries_present_flag u(1)   if( ph_virtual_boundaries_present_flag ) {    ph_num_ver_virtual_boundaries u(2)    for( i = 0; i < ph_num_ver_virtual_boundaries; i++ )     ph_virtual_boundaries_pos_x[ i ] u(13)    ph_num_hor_virtual_boundaries u(2)    for( i = 0; i < ph_num_hor_virtual_boundaries; i++ )     ph_virtual_boundaries_pos_y[ i ] u(13)   }  }  if( output_flag_present_flag )   pic_output_flag u(1)  if( rpl_info_in_ph_flag ) {   for( i = 0; i < 2; i++ ) {    if( num_ref_pic_lists_in_sps[ i ]       >    0          &&      ( i = = 0 | | ( i = = 1 && rpll_idx_present_flag ) ) )    pic_rpl_sps_flag[ i ] u(1)    if( pic_rpl_sps_flag[ i ] ) {    if( num_ref_pic_lists_in_sps[ i ]       >    1          &&       ( i = = 0     if( num_| | (i = = 1 && rpll_idx_present_flag ) ) )      pic_rpl_idx[ i ] u(v)    } else     ref_pic_list_struct( i, num_ref_pic_lists_in_sps[ i ] )    for( j = 0; j < NumLtrpEntries[ i ][ RplsIdx[ i ] ]; j++ ) {     if( ltrp_in_slice_header_flag[ i ][ RplsIdx[ i ] ] )      pic_poc_lsb_lt[ i ][ j ] u(v)     pic_delta_poc_msb_present_flag[ i ][ j ] u(1)     if( pic_delta_poc_msb_present_flag[ i ][ j ] )      pic_delta_poc_msb_cycle_lt[ i ][ j ] ue(v)    }   }  }  if( partition_constraints_override_enabled_flag )   partition_constraints_override_flag u(1)  if( pic_intra_slice_allowed_flag ) {   if( partition_constraints_override_flag ) {    pic_log2_diff_min_qt_min_cb_intra_slice_luma ue(v)    pic_max_mtt_hierarchy_depth_intra_slice_luma ue(v)    if( pic_max_mtt_hierarchy_depth_intra_slice_luma != 0 ) {     pic_log2_diff_max_bt_min_qt_intra_slice_luma ue(v)     pic_log2_diff_max_tt_min_qt_intra_slice_luma ue(v)   }    if( qtbtt_dual_tree_intra_flag ) {     pic_log2_diff_min_qt_min_cb_intra_slice_chroma ue(v)     pic_max_mtt_hierarchy_depth_intra_slice_chroma ue(v)     if( pic_max_mtt_hierarchy_depth_intra_slice_chroma != 0 ) {      pic_log2_diff_max_bt_min_qt_intra_slice_chroma ue(v)      pic_log2_diff_max_tt_min_qt_intra_slice_chroma ue(v)     }    }   }   if( cu_qp_delta_enabled_flag && qp_delta_info_in_ph_flag )    pic_cu_qp_delta_subdiv_intra_slice ue(v)   if( pps_cu_chroma_qp_offset_list_enabled_flag )    pic_cu_chroma_qp_offset_subdiv_intra_slice ue(v)  }  if( pic_inter_slice_allowed_flag ) {   if( partition_constraints_override_flag ) {    pic_log2_diff_min_qt_min_cb_inter_slice ue(v)    pic_max_mtt_hierarchy_depth_inter_slice ue(v)    if( pic_max_mtt_hierarchy_depth_inter_slice != 0 ) {     pic_log2_diff_max_bt_min_qt_inter_slice ue(v)     pic_log2_diff_max_tt_min_qt_inter_slice ue(v)    }   }   if( cu_qp_delta_enabled_flag && qp_delta_info_in_ph_flag )    pic_cu_qp_delta_subdiv_inter_slice ue(v)   if( pps_cu_chroma_qp_offset_list_enabled_flag )    pic_cu_chroma_qp_offset_subdiv_inter_slice ue(v)   if( sps_temporal_mvp_enabled_flag ) {    pic_temporal_mvp_enabled_flag u(1)    if( pic_temporal_mvp_enabled_flag && rpl_info_in_ph_flag ) {     pic_collocated_from_10_flag u(1)     if( ( collocated_from_10_flag                          && num_ref_entries[ 0 ][ PicRplsIdx[ 0 ] ]     >    1    )       | |      (          !collocated_from_10_flag                  && num_ref_entries[ 1 ][ PicRplsIdx[ 1 ] ] > 1 ) )      pic_collocated_ref_idx ue(v)    }   }   pic_six_minus_max_num_merge_cand ue(v)   if( sps_affine_enabled_flag )    pic_five_minus_max_num_subblock_merge_cand ue(v)   if( sps_fpel_mmvd_enabled_flag )    pic_fpel_mmvd_enabled_flag u(1)   if( sps_bdof_pic_present_flag )    pic_disable_bdof_flag u(1)   if( sps_dmvr_pic_present_flag )    pic_disable_dmvr_flag u(1)   if( sps_prof_pic_present_flag )    pic_disable_prof_flag u(1)   if( sps_triangle_enabled_flag && MaxNumMergeCand >= 2 )    pic_max_num_merge_cand_minus_max_num_triangle_cand ue(v)   if( ( pps_weighted_pred_flag | | pps_weighted_bipred_flag ) && wp_info_in_ph_flag )    pred_weight_table( )   }   if( sps_ibc_enabled_flag )    pic_six_minus_max_num_ibc_merge_cand ue(v)   if( sps_joint_cbcr_enabled_flag )    pic_joint_cber_sign_flag u(1)   if( sps_sao_enabled_flag && sao_info_in_ph_flag ) {   pic_sao_luma_enabled_flag u(1)   if(ChromaArrayType != 0 )    pic_sao_chroma_enabled_flag u(1)  }  if( sps_alf_enabled_flag && alf_info_in_ph_flag ) {   pic_alf_enabled_flag u(1)   if( pic_alf_enabled_flag ) {    pic_num_alf_aps_ids_luma u(3)    for( i = 0; i < pic_num_alf_aps_ids_luma; i++ )     pic_alf_aps_id_luma[ i ] u(3)    if( ChromaArrayType != 0 )     pic_alf_chroma_idc u(2)    if( pic_alf_chroma_idc )     pic_alf_aps_id_chroma u(3)   }  }  pic_dep_quant_enabled_flag u(1)  if( !pic_dep_quant_enabled_flag )   sign_data_hiding_enabled_flag u(1)  if( deblocking_filter_override_enabled_flag ) {    dbf_info_in_ph_flag u(1)    if( dbf_info_in_ph_flag ) {     pic_deblocking_filter_override_flag u(1)     if( pic_deblocking_filter_override_flag ) {      pic_deblocking_filter_disabled_flag u(1)      if( !pic_deblocking_filter_disabled_flag ) {       pic_beta_offset_div2 se(v)       pic_tc_offset_div2 se(v)     }    }   }  }  if( sps_lmcs_enabled_flag ) {   pic_lmcs_enabled_flag u(1)   if( pic_lmcs_enabled_flag ) {    pic_lmcs_aps_id u(2)    if( ChromaArrayType != 0 )     pic_chroma_residual_scale_flag u(1)   }  }  if( sps_scaling_list_enabled_flag ) {   pic_scaling_list_present_flag u(1)   if( pic_scaling_list_present_flag )    pic_scaling_list_aps_id u(3)  }  if( picture_header_extension_present_flag ) {   ph_extension_length ue(v)   for( i = 0; i < ph_extension_length; i++)    ph_extension_data_byte[ i ] u(8)   rbsp_trailing_bits( )   }  }

7.3.7.1 General slice header syntax slice_header( ) { Descriptor  picture_header_in_slice_header_flag u(1)  if( picture_header_in_slice_header_flag )   picture_header_structure( )  if( subpics_present_flag )   slice_subpic_id u(v)  if( rect_slice_flag | | NumTilesInPic > 1 )   slice_address u(v)  if( !rect_slice_flag && NumTilesInPic > 1 )   num_tiles_in_slice_minus1 ue(v)  if( pic_inter_slice_allowed_flag )   slice_type ue(v)  if( separate_colour_plane_flag = = 1 )   colour_plane_id u(2)  if( !rpl_info_in_ph_flag &&( ( nal_unit_type != IDR_W_RADL && nal_unit_type                                       !=    IDR_N_LP ) | | sps_idr_rpl_present_flag ) ) {   for( i = 0; i < 2; i++ ) {    if( num_ref_pic_lists_in_sps[ i ]         >    0       &&      ( i = = 0 | | ( i = = 1 && rpl1_idx_present_flag ) ) )     slice_rpl_sps_flag[ i ] u(1)    if( slice_rpl_sps_flag[ i ] ) {      if( num_ref_pic_lists_in_sps[ i ] > 1 &&        ( i = = 0 | | ( i = = 1 && rpl1_idx_present_flag ) ) )       slice_rpl_idx[ i ] u(v)    } else     ref_pic_list_struct( i, num_ref_pic_lists_in_sps[ i ] )    for( j = 0; j < NumLtrpEntries[ i ][ RplsIdx[ i ] ]; j++ ) {     if( ltrp_in_slice_header_flag[ i ][ RplsIdx[ i ] ] )      slice_poc_lsb_lt[ i ][ j ] u(v)     slice_delta_poc_msb_present_flag[ i ][ j ] u(1)     if( slice_delta_poc_msb_present_flag[ i ][ j ] )      slice_delta_poc_msb_cycle_lt[ i ][ j ] ue(v)    }   }  }  if( rpl_info_in_ph_flag | | ( ( nal_unit_type != IDR_W_RADL && nal_unit_type                                       !=    IDR_N_LP ) | | sps_idr_rpl_present_flag ) ) {   if( ( slice_type != I && num_ref_entries[ 0 ][ RplsIdx[ 0 ] ] > 1 ) | |    ( slice_type = = B && num_ref_entries[ 1 ][ RplsIdx[ 1 ] ] > 1 ) ) {   num_ref_idx_active_override_flag u(1)   if( num_ref_idx_active_override_flag )    for( i = 0; i < ( slice_type = = B ? 2: 1 ); i++ )     if( num_ref_entries[ i ][ RplsIdx[ i ] ] > 1 )      num_ref_idx_active_minus1[ i ] ue(v)   }  }  if( slice_type != I ) {   if( cabac_init_present_flag )    cabac_init_flag u(1)   if( pic_temporal_mvp_enabled_flag && !rpl_info_in_ph_flag ) {    if( slice_type = = B )     slice_collocated_from_10_flag u(1)    if( ( slice_collocated_from_10_flag && NumRefIdxActive[ 0 ] > 1 ) | |      ( !slice_collocated_from_10_flag && NumRefIdxActive[ 1 ] > 1 ) )      slice_collocated_ref_idx ue(v)    }    if( !wp_info_in_ph_flag && ( ( pps_weighted_pred_flag && slice_type = =                 P            )                  | |     ( pps_weighted_bipred_flag && slice_type = = B ) ) )    pred_weight_table( )  }  slice_qp_delta se(v)  if( pps_slice_chroma_qp_offsets_present_flag ) {   slice_cb_qp_offset se(v)   slice cr_qp offset se(v)   if( sps_joint_cbcr_enabled_flag )    slice_joint_cber_qp_offset se(v)  }  if( pps_cu_chroma_qp_offset_list_enabled_flag )   cu_chroma_qp_offset_enabled_flag u(1)  if( cu_qp_delta_enabled_flag && !qp_delta_info_in_ph_flag )   slice_cu_qp_delta_subdiv ue(v)  if( sps_sao_enabled_flag && !sao_info_in_ph_flag ) {   slice_sao_luma_flag u(1)   if( ChromaArrayType != 0 )    slice_sao_chroma_flag u(1)  }  if( sps_alf_enabled_flag && !alf_info_in_ph_flag ) {   slice_alf_enabled_flag u(1)   if( slice_alf_enabled_flag ) {    slice_num_alf_aps_ids_luma u(3)    for( i = 0; i < slice_num_alf_aps_ids_luma; i++ )     slice_alf_aps_id_luma[ i ] u(3)    if( ChromaArrayType != 0 )     slice_alf_chroma_idc u(2)    if( slice_alf_chroma_idc )     slice_alf_aps_id_chroma u(3)   }  }  if( deblocking_filter_override_enabled_flag && !dbf_info_in_ph_flag )   slice_deblocking_filter_override_flag u(1)  if( slice_deblocking_filter_override_flag ) {   slice_deblocking_filter_disabled_flag u(1)   if( !slice_deblocking_filter_disabled_flag ) {   slice_beta_offset_div2 se(v)   slice_tc_offset_div2 se(v)   }  }  if( entry_point_offsets_present_flag && NumEntryPoints > 0 ) {   offset_len_minus1 ue(v)   for( i= 0; i < NumEntryPoints; i++ )    entry_point_offset_minus1[ i ] u(v)  }  if( slice_header_extension_present_flag ) {   slice_header_extension_length ue(v)   for( i = 0; i < slice_header_extension_length; i++)    slice_header_extension_data_byte[ i ] u(8)  }  byte_alignment( ) }

7.3.7.2 Weighted prediction parameters syntax pred_weight_table( ) { Descriptor  luma_log2_weight_denom ue(v)  if( ChromaArrayType != 0 )   delta_chroma_log2_weight_denom se(v)  if( wp_info_in_ph_flag )   num_10_weights ue(v)  for( i = 0; i < num_10_weights; i++ )   luma_weight_10_flag[ i ] u(1)  if( ChromaArrayType != 0 )   for( i = 0; i < num_10_weights; i++ )    chroma_weight_10_flag[ i ] u(1)  for( i = 0; i < num_10_weights; i++ ) {   if( luma_weight_10_flag[ i ] ) ) {    delta_luma_weight_10[ i ] se(v)    luma_offset_10[ i ] se(v)   }   if( chroma_weight_10_flag[ i ] ) )    for( j = 0; j < 2; j++ ) {     delta_chroma_weight_10[ i ][ j ] se(v)     delta_chroma_offset_10[ i ][ j ] se(v)    }  }  if( slice_type = = B ) {   if( wp_info_in_ph_flag )    num_11_weights ue(v)   for( i = 0; i < num_11_weights; i++ )    luma_weight_l1_flag[ i ] u(1)   if( ChromaArrayType != 0 )    for( i = 0; i < num_l1_weights; i++ )     chroma_weight_l1_flag[ i ] u(1)    for( i = 0; i < num_l1_weights; i++ ) {     if( luma_weight_l1_flag[ i ] ) {      delta_luma_weight_l1[ i ] se(v)      luma_offset_l1[ i ] se(v)     }     if( chroma_weight_l1_flag[ i ] )      for( j = 0; j < 2; j++ ) {       delta_chroma_weight_l1[ i ][ j ] se(v)    }   }  } }

When a picture consists of more than one video coding layer (VCL) network abstraction layer (NAL) unit, a picture header (PH) NAL unit may be present in the prediction unit (PU).

If a PH NAL unit is present in a prediction unit (PU), the first VCL NAL unit of a picture may be the first VCL NAL unit that follows the PH NAL unit in decoding order of the picture. Otherwise (a PH NAL unit may not be present in the PU), the first VCL NAL unit of a picture may be the only VCL NAL unit of the picture.

2.8. Embodiments From JVET-Q0513 and JVET-Q0820

In JVET-Q0513, a clipping issue is raised that after inverse ACT, the residual may exceed 16-bit dynamic range. A solution is to clip the input of inverse ACT according to the range of [-( 1<< BitDepth ), ( 1 << BitDepth ) - 1].

However, when YCgCo-R colour space is used, e.g., described in JVET-Q0820-v3, the dynamic range of Co and Cg is enlarged by 2-time and might exceed the range of [-( 1<< BitDepth ), ( 1 << BitDepth ) - 1].

3. Technical Problems Solved by Embodiments and Solutions Described Herein

1., the ACT and luma BDPCM modes can be enabled for one block. However, the chroma BDPCM mode may always be disabled on blocks coded with ACT mode. Therefore, the prediction signal may be derived differently for luma and chroma blocks in the same coding unit, which may be less efficient.

2. The quantization parameter (QP) of a block may become a minus number when ACT is enabled.

3. Some designs of ACT may not support lossless coding.

4. The signaling of usage of ACT may not be block size dependent.

5. The maximal palette size and the maximal predictor size are fixed numbers, which may limit the flexibility of palette mode.

6. Escape samples employs Exponential-Golomb (EG) with 3th order as the binarization method, but the binarization for escape samples is not dependent on Quantization Parameter (QP).

7. Due to that when reference picture list (RPL) is signaling in the Picture header (PH), the number of active entries for each slice is still signaled in the slice header, the signaling of collocated is suboptimal, and the signaling of the weighted prediction (WP) table is broken.

8. For YCgCo-R colour space, the range of [-( 1<< BitDepth ), ( 1<< BitDepth ) -1] may not be large enough to accommodate residuals.

4. Technical Solutions

The technical solutions described below should be considered as examples to explain general concepts. These technical solutions should not be interpreted in a narrow way. Furthermore, these technical solutions can be combined in any manner.

In the following description, the term ‘block’ may represent a video region, such as a coding unit (CU), a prediction unit (PU), and/or a transform unit (TU), which may contain samples in three colour components. The term ‘BDPCM’ is not limited to the design in VVC, but it may present the technologies that coding residuals using different prediction signal generation methods.

In the following description, a video block coded using a joint coding of chroma residuals (JCCR) mode includes signaling only one chroma residual block (e.g., the Cb residual block), and the other chroma residual block (e.g., the Cr residual block) is derived based on the signaled chroma residual block and one or more flags (e.g., at the transform unit level) indicating a specific JCCR mode. As described, the JCCR mode leverages the correlation between the Cb residual and the Cr residual to improve coding efficiency.

Interaction Between ACT and BDPCM (Items 1-4)

1. Whether to enable chroma BDPCM mode may depend on the usage of ACT and/or luma BDPCM mode.

-   a. In one example, when ACT is enabled on a block, the indication of     the usage of chroma BDPCM mode (e.g. intra_bdpcm_chroma_flag) may be     inferred to be the indication of the usage of the luma BDPCM mode     (e.g. intra_bdpcm_luma_flag).     -   i. In one example, the inferred value of chroma BDPCM mode is         defined as (ACT and luma BDPCM modes are enabled? true: false).         -   1. In one example, the intra_bdpcm_chroma_flag may be set             equal to false when intra_bdpcm_luma_flag is false.             -   a. Alternatively, the intra_bdpcm_chroma_flag may be set                 equal to true when intra_bdpcm_luma_flag is true.     -   ii. Alternatively, in one example, the indication of the usage         of chroma BDPCM mode may be inferred to be true if the         indication of the usage of the luma BDPCM mode and ACT for the         block are true. -   b. Alternatively, whether to signal the usage of ACT for a block may     be conditionally checked, such as the same BDPCM prediction     direction is used for both luma and chroma samples in the block.     -   i. Alternatively, furthermore, indication of usage of ACT is         signaled after usage of BDPCM modes.

2. When ACT is enabled on a block, the indication of the prediction direction of chroma BDPCM mode (e.g. intra_bdpcm_chroma_dir_flag) may be inferred to be the indication of the prediction direction of the usage of the luma BDPCM mode (e.g. intra_bdpcm_luma_dir_flag).

-   a. In one example, the inferred value of intra_bdpcm_chroma_dir_flag     is defined as (ACT is enabled? intra_bdpcm_luma_dir_flag: 0).     -   i. In one example, the indication of the prediction direction of         chroma BDPCM mode may be inferred to horizontal if the         indication of the prediction direction of the luma BDPCM mode is         horizontal.     -   ii. Alternatively, in one example, the indication of the         prediction direction of chroma BDPCM mode may be inferred to         vertical if the indication of the prediction direction of the         luma BDPCM mode is vertical.

3. The ACT and BDPCM modes may be exclusively applied.

-   a. In one example, when ACT mode is enabled on a block, the BDPCM     mode may be disabled on the block.     -   i. Alternatively, furthermore, the indication of usage of BDPCM         mode may be signaled after the signaling of the indication of         usage of ACT mode.     -   ii. Alternatively, furthermore, the indication of usage of BDPCM         mode may be not signaled and inferred to false (0). -   b. In one example, when BDPCM mode is enabled on a block, the ACT     mode may be disabled on the block.     -   i. Alternatively, furthermore, the indication of usage of ACT         mode may be signaled after the signaling of the indication of         usage of BDPCM mode.     -   ii. Alternatively, furthermore, the indication of usage of ACT         mode may be not signaled and inferred to false (0). -   c. In one example, the BDPCM mode in the above examples may denote     luma BDPCM mode and/or chroma BDPCM mode.

4. Inverse ACT may be applied before reverse BDPCM at the decoder.

-   a. In one example, ACT may be applied even when luma and chroma     BDPCM have a different prediction mode. -   b. Alternatively, at the encoder, forward ACT may be applied after     BDPCM.

QP Setting When ACT Is Enabled (Item 5)

5. It is proposed to clip the QP when ACT is enabled.

-   a. In one example, the clipping function may be defined as (1, h,     x), where 1is the lowest possible value of the input x and h is the     highest possible value of the input x.     -   i. In one example, 1 may be set equal to 0.     -   ii. In one example, h may be set equal to 63. -   b. In one example, the QP may be the qP given in Section 2.5. -   c. In one example, the clipping may be performed after the QP     adjustment for ACT mode. -   d. In one example, when transform skip is applied, 1may be set equal     to the minimal allowed QP for transform skip mode.

Palette Mode Related (Item 6-7)

6. The values of maximum allowed palette size and/or maximum allowed predictor size may depend on a coding characteristics. Assume S₁ is the maximal palette size (or palette predictor size) associated with a first coding characteristics; and S₂ is the maximal palette size (or palette predictor size) associated with a second coding characteristics.

-   a. In one example, the coding characteristics may be colour     component.     -   i. In one example, the maximum allowed palette size and/or         maximum allowed predictor size for different colour components         may have different values.     -   ii. In one example, the values of maximum allowed palette size         and/or maximum allowed predictor size for a first colour         components (e.g., Y in YCbCr, G in RGB) may be different from         those for the other two- colour components (e.g., Cb and Cr in         YCbCr, B and R in RGB) excluding the first colour component. -   b. In one example, the coding characteristics may be the     quantization parameters (QPs).     -   i. In one example, S₁ and/or S₂ for QP₁ may be smaller than the         S₁ and/or S₂ for QP₂ if QP₁ is greater than QP₂     -   ii. In one example, the QP may be the slice level QP or block         level QP. -   c. In one example, S₂ may be greater than or equal to S₁ -   d. For a first coding characteristics and a second coding     characteristics, indications of maximum palette sizes/palette     predictor sizes may be signaled separately or inferred from one to     another.     -   i. In one example, S₁ may be signaled and S₂ may be derived         based on S_(1.)         -   1. In one example, S₂ may be inferred to S₁ - n.         -   2. In one example, S₂ may be inferred to S₁ >> n.         -   3. In one example, S₂ may be inferred to floor (S₁ / n),             where floor(x) denotes the maximum integer no larger than x. -   e. In one example, S₁ and/or S₂ may be signaled at a high level     (e.g. SPS/PPS/PH/slice header) and adjusted at a lower level (e.g.     CU/block).     -   i. How to adjust S₁ and/or S₂ may depend on the coded         information.         -   1. How to adjust S₁ and/or S₂ may depend on the current QP.             -   a. In one example, the S₁ and/or S₂ may be reduced if                 the current QP is increased.         -   2. How to adjust S₁ and/or S₂ may depend on block dimension.             -   a. In one example, the S₁ and/or S₂ may be increased if                 the current blocks size is increased.

    f. S₁ and/or S₂ may be dependent on whether LMCS is used.

7. The parameters associated with a binarization method for escape samples/pixels may depend on coded information, e.g., the quantization parameters (QPs).

-   a. In one example, EG binarization method may be utilized, and the     order of the EG binarization, denoted by k, may be dependent on the     coded information.     -   i. In one example, k may be reduced when the current QP is         increased.

Signaling of ACT Mode (Item 8-10)

8. Indications of the allowed maximum and/or minimum ACT size may be signaled in sequence/video/slice/tile/subpicture/brick/other video processing unit level or derived based on coded information.

-   a. In one example, they may be signaled in SPS/PPS/Picture     header/slice header. -   b. In one example, they may be conditionally signaled, such as     according to the ACT is enabled. -   c. In one example, N-level of allowed maximum and/or minimum ACT     size may be signaled/defined, e.g., N = 2.     -   i. In one example, the allowed maximum and/or minimum ACT size         may be set to either K0 or K1 (e.g., K0=64, K1=32).     -   ii. Alternatively, furthermore, indication of the level may be         signaled, e.g., when N = 2, a flag may be signaled. -   d. In one example, indications of the differences between the     allowed maximum and/or minimum ACT size and the allowed maximum     and/or minimum transform (or transform skip) sizes (e.g., for the     luma component) may be signaled. -   e. In one example, the allowed maximum and/or minimum ACT size may     be derived from the allowed maximum and/or minimum (or transform     skip) sizes (e.g., for the luma component). -   f. Alternatively, furthermore, whether to and/or how to signal     indications of ACT usage and other side information related to ACT     may be dependent on the allowed maximum and/or minimum.

9. When a block is greater than the allowed maximum ACT size (or allowed maximum transform size), the block may be automatically split to multiple sub-blocks wherein all sub-blocks share the same prediction mode (e.g., all of them are intra coded), and the ACT may be enabled in the sub-block level, instead of the block level.

10. The indication of the usage of ACT mode may be conditionally signaled based on the block dimensions (e.g., block width and/or height, block width times height, ratios between block width and height, maximum/minimum values of block width and height) and/or maximumly allowed ACT sizes.

-   a. In one example, the indication of the usage of ACT mode may be     signaled when certain conditions, e.g., according to block     dimension, are satisfied.     -   i. In one example, the conditions are if the current block width         is smaller than or equal to m and/or the current block height is         smaller than or equal to n.     -   ii. In one example, the conditions are if the current block         width times height is smaller than or no larger than m.     -   iii. In one example, the conditions are if the current block         width times height is larger than or no smaller than m. -   b. Alternatively, in one example, the indication of the usage of ACT     mode may be not signaled when certain conditions, e.g., according to     block dimension, are NOT satisfied.     -   i. In one example, the conditions are if the current block width         is larger than m and/or the current block height is larger than         n.     -   ii. In one example, the conditions are if the current block         width times height is smaller than or no larger than m.     -   iii. In one example, the conditions are if the current block         width times height is larger than or no smaller than m.     -   iv. Alternatively, furthermore, the indication of the usage of         ACT mode may be inferred to 0. -   c. In above examples, the variables m, n may be pre-defined (e.g.,     4, 64, 128), or signaled, or derived on-the-fly.     -   i. In one example, m and/or n may be derived based on a decoded         message in the SPS/PPS/APS/CTU row/group of CTUs/CU/block.         -   1. In one example, m and/or n may be set equal to the             maximally allowed transform size (e.g. MaxTbSizeY).

Signaling of Constraint Flags in General Constraint Information Syntax (Item 11-16)

The constraint flags below may be signaled in a video unit other than SPS. For example, they may be signaled in the general constraint information syntax specified in JVET-P2001-vE.

11. It is proposed to have a constraint flag to specify whether the SPS ACT enabling flag (e.g., sps_act_enabled_flag) may be equal to 0.

-   a. In one example, the flag may be denoted as     no_act_constraint_flag.     -   i. When this flag is equal to 1, the SPS ACT enabling flag         (e.g., sps_act_enabled_flag) may be equal to 0.     -   ii. When this flag is equal to 0, it does not impose such a         constraint.

12. It is proposed to have a constraint flag to specify whether the SPS BDPCM enabling flag (e.g., sps_bdpcm_enabled_flag) may be equal to 0.

-   a. In one example, the flag may be denoted as     no_bdpcm_constraint_flag.     -   i. When this flag is equal to 1, the SPS BDPCM enabling flag         (e.g., sps_bdpcm_enabled_flag) may be equal to 0.     -   ii. When this flag is equal to 0, it does not impose such a         constraint.

13. It is proposed to have a constraint flag to specify whether the SPS chroma BDPCM enabling flag (e.g., sps_bdpcm_chroma_enabled_flag) may be equal to 0.

-   a. In one example, the flag may be denoted as     no_bdpcm_chroma_constraint_flag.     -   i. When this flag is equal to 1, the SPS chroma BDPCM enabling         flag (e.g., sps_bdpcm_chroma_enabled_flag) may be equal to 0.     -   ii. When this flag is equal to 0, it does not impose such a         constraint.

14. It is proposed to have a constraint flag to specify whether the SPS palette enabling flag (e.g., sps_palette_enabled_flag) may be equal to 0.

-   a. In one example, the flag may be denoted as     no_palette_constraint_flag.     -   i. When this flag is equal to 1, the SPS palette enabling flag         (e.g. sps_palette_enabled_flag) may be equal to 0.     -   ii. When this flag is equal to 0, it does not impose such a         constraint.

15. It is proposed to have a constraint flag to specify whether the SPS RPR enabling flag (e.g., ref_pic_resampling_enabled_flag) may be equal to 0.

-   a. In one example, the flag may be denoted as     no_ref_pic_resampling_constraint_flag.     -   i. When this flag is equal to 1, the SPS RPR enabling flag (e.g.         ref_pic_resampling_enabled_flag) may be equal to 0.     -   ii. When this flag is equal to 0, it does not impose such a         constraint.

16. In the above examples (bullet 11-15), such constraint flags may be conditionally signaled, e.g., according to chroma format (e.g., chroma_format_idc) and/or separate plane coding or ChromaArrayType.

ACT QP Offset (Item 17-19)

17. It is proposed that ACT offsets may be applied after applying other chroma offsets (e.g., those in PPS and/or picture header (PH) and/or slice header (SH)) when ACT is applied on a block.

18. It is proposed to have PPS and/or PH offsets other than -5 for JCbCr mode 2 when YCgCo colour transform is applied on a block.

-   a. In one example, the offset may be other than -5. -   b. In one example, the offset may be indicated in PPS (e.g., as     pps_act_cber_qp_offset_plus6) and the offset may be set as     pps_act_cber_qp_offset_plus6 - 6. -   c. In one example, the offset may be indicated in PPS (e.g., as     pps_act_cber_qp_offset_plus7) and the offset may be set as     pps_act_cber_qp_offset_plus7 - 7.

19. It is proposed to have PPS and/or PH offsets other than 1 for JCbCr mode 2 when YCgCo-R is applied on a block.

-   a. In one example, the offset may be other than -1. -   b. In one example, the offset may be indicated in PPS (e.g., as     pps_act_cbcr_qp_offset) and the offset may be set as     pps_act_cbcr_qp_offset. -   c. In one example, the offset may be indicated in PPS (e.g., as     pps_act_cbcr_qp_offset_plus1) and the offset may be set as     pps_act_cbcr_qp_offset_plus1 - 1.

20. It is proposed that when JCCR is used, the QP offset for ACT with YCgCo transform, denoted as act_qp_offset, may depend on JCCR mode.

-   a. In one example, when JCCR mode is 1, act_qp_offset may be -5.     -   i. Alternatively, in one example, when JCCR mode is 1,         act_qp_offset may be -6. -   b. In one example, when JCCR mode is 2, act_qp_offset may be -7.     -   i. Alternatively, in one example, when JCCR mode is 2,         act_qp_offset may be (-7 - pps_joint_cbcr_qp_offset -         slice_joint_cbcr_qp_offset).     -   ii. Alternatively, in one example, when JCCR mode is 2,         act_qp_offset may be (-7 + pps_joint_cbcr_qp_offset +         slice_joint_cbcr_qp_offset). -   c. In one example, when JCCR mode is 3, the ACT offset may be -4.     -   i. Alternatively, in one example, when JCCR mode is 3, the ACT         offset may be -5.

21. It is proposed that when JCCR is used, the QP offset for ACT with YCgCo-R transform, denoted as act_qp_offset, may depend on JCCR mode.

-   a. In one example, when JCCR mode is 1, act_qp_offset may be 1.     -   i. Alternatively, in one example, when JCCR mode is 1,         act_qp_offset may be 0. -   b. In one example, when JCCR mode is 2, act_qp_offset may be -1.     -   i. Alternatively, in one example, when JCCR mode is 2,         act_qp_offset may be (-1 - pps_joint_cbcr_qp_offset -         slice_joint_cbcr_qp_offset).     -   ii. Alternatively, in one example, when JCCR mode is 2,         act_qp_offset may be (-1 + pps_joint_cbcr_qp_offset +         slice_joint_cbcr_qp_offset). -   c. In one example, when JCCR mode is 3, the ACT offset may be 2.     -   i. Alternatively, in one example, when JCCR mode is 3, the ACT         offset may be 1.

22. Whether to signal the QP offsets for ACT and JCCR coded blocks (e.g., slice_act_cbcr_qp_offset) may depend on the condition check of whether JCCR is enabled.

-   a. Alternatively, furthermore, the indication of whether QP offsets     for ACT and JCCR coded blocks are present (e.g.,     pps_joint_cbcr_qp_offset_present_flag/     pps_slice_cbcr_qp_offset_present_flag) may depend on the condition     check of whether JCCR is enabled.

23. How to derive/signal delta QPs may depend on the coded information, such as coded mode, usage of a coding tool.

-   a. In one example, how to derive/signal delta QPs may depend on     usage of ACT for current block and/or previously coded blocks (e.g.,     above and left neighboring blocks). -   b. In one example, the derivation and/or signaling of delta QPs may     depend on whether the current block and previously coded blocks used     for QP predictor derivation share the same coded mode or     enabling/disabling status of a coding tool (e.g., ACT). -   c. In one example, for a current block coded with coding tool X     (e.g., ACT/Transform Skip), the QP predictor derivation process may     be different from other blocks with X being disabled.     -   i. In one example, the QP predictor for a current block coded         with coding tool X may be derived from those blocks with coding         tool X being enabled.     -   ii. In one example, the QP predictor for a current block coded         without coding tool X may be derived from those blocks with         coding tool X being disabled.

24. How to signal the QP offsets in PPS may be independent from the SPS.

-   a. Alternatively, furthermore, an indication of colour format and/or     an indication of enabling of ACT may be signaled in PPS.     -   i. Alternatively, furthermore, the QP offsets may be signaled         under the condition check of the indications.

25. Whether to signal the QP offsets (e.g., applied to ACT coded blocks) in a 1st level (e.g., picture level)

-   a. It is proposed that if the QP offsets (e.g., applied to ACT coded     blocks) are present in a 2nd level (e.g., slice level), the     signaling of the QP offsets in a 1st level is skipped.

26. QPs mentioned in the above examples may also be present in picture/slice/tile/subpicture level (e.g., picture header/PPS/slice header).

27. Overwriting mechanism may be used for signaling QP offsets may be utilized. That is, the QP offsets may be signaled in a 1st level (e.g., PPS), but overwritten in a 2nd level (e.g., Picture Header).

-   a. Alternatively, furthermore, a flag may be signaled in the 1st     level or 2nd level to indicate whether overwriting is enabled. -   b. Alternatively, when overwriting is enabled, there may be no need     to signal the related information in the 1st level.     -   i. In one example, the QP offsets (e.g., applied to ACT coded         blocks) may not be signaled in the 1st level (e.g., PPS) if         overwritten is applied for a 2nd level (e.g., slice). -   c. Alternatively, furthermore, differences of QP offsets between the     1st and 2nd level may be signaled in the 2nd level.

28. In one example, a first QP and a second QP of an i-th (e.g., i being 0 to 2) colour component are both derived for a first ACT coded block. The first QP of the i-th colour component is used to perform reconstruction and/or deblocking and the second QP of the i-th colour component is used to predict QP(s) of the following coded blocks. The first QP and the second QP of the i-th colour component may be different.

-   a. In one example, the first luma QP may be equal to the second luma     QP adding one or multiple offsets.     -   i. In one example, the offsets may be signaled, such as in         SPS/PPS/picture header/slice header/CTU/CU/other video         processing unit (e.g., pps_act_y_qp_offset,         pps_act_cb_qp_offset, pps_act_cb_qp_offset,         pps_act_cbcr_qp_offset, slice_act_y_qp_offset,         slice_act_cb_qp_offset, slice_act_cb_qp_offset).     -   ii. In one example, the offsets may be fixed (e.g., -5, -3, 1,         3). -   b. In one example, QP offsets signaled in PPS/Slice header/picture     header for ACT coded blocks (e.g., pps_act_y_qp_offset,     pps_act_cb_qp_offset, pps_act_cb_qp_offset, pps_act_cbcr_qp_offset,     slice_act_y_qp_offset, slice_act_cb_qp_offset,     slice_act_cb_qp_offset).are disallowed to be taken into     consideration to predict QP values of following blocks to be coded.

Related to Deblocking Filter

29. It is proposed to take the QP offsets signaled/derived in SPS/PPS/Picture header/slice headers into consideration during the deblocking filter process (e.g, in determination of Tc and/or Beta parameters used in deblocking filter process) and/or prediction coding of delta QPs for other blocks.

-   a. In one example, the QP used in the deblocking filter process may     depend on QP offsets signaled/derived in SPS/PPS/Picture     header/slice headers. -   b. In one example, the QP offsets are related to the luma component     (or G component in RGB coding).

Related to Picture Header

30. When the reference picture list (RPL) is in Picture Header (PH), the number of active entries for reference picture lists 0 and/or 1 may be the same for all slices of the picture.

-   a. In one alternative, for i in the range of 0 to 1, inclusive, the     value of NumRefIdxActive[i] is set to be equal to     num_ref_idx_default_active_minus1[i] + 1. -   b. In another alternative, when RPL is in the PH, another syntax     element (e.g., a flag) may be further signaled in the PH to indicate     how the number of active entries for reference picture lists may be     derived.     -   i. In one example, depending on the “another syntax element”,         the number of active entries may be derived without additional         signaling or with additional signaling.     -   ii. In one example, the following may be applied:         -   1. If the flag is equal to X (e.g., X = 1), then for i in             the range of 0 to 1, inclusive, NumRefIdxActive[i] is set to             be equal to num_ref_idx_default_active_minusl[i] + 1.         -   2. Otherwise (this flag is equal to (1-X)), one or two more             syntax elements are signaled in the PH (e.g.,             num_active_entries_minus1[i] for i equal to 0 and 1) and             NumRefIdxActive[i] is set to be equal to             num_active_entries_minus1[i] + 1.         -   3. Alternatively, prediction coding may be applied wherein             differences of number of active entries may be signaled             instead, e.g., relative the default values signaled by             num_ref_idx_default_active_minus1[i] signaled in the PPS.     -   iii. Alternatively, two flags may be signaled in the PH to         separately control whether information of the number of active         entries is signaled in the PH for the reference picture lists 0         and 1, in a similar manner as above when only flag is used for         controlling both. -   c. In the above examples, it is assumed that B slices may be used.     If all slices or all inter slices referring to the same PH are P     slices, then only the number of active entries for reference picture     list 0 may be derived. -   d. Alternatively, furthermore, how to signal new syntax elements     (e.g., the ‘another syntax element’ in bullet 29.b; the ‘one or two     more syntax elements’ in bullet 30.b.ii.2 and in bullet 30.b.iii)     may depend on the allowed slice types referring to the PH.     -   i. In one example, the new syntax element may be signaled under         the condition check of whether at least one slice is inter coded         or P slice or B slice; or whether all slices are intra slices.

31. It is proposed that the following syntax in the PH syntax structure

  if(sps_temporal_mvp_enabled_flag ) {    pic_temporal_mvp_enabled_flag u(1)    if(pic_temporal_mvp_enabled_flag && rpl_info_in_ph_flag ) {     pic_collocated_from_10_flag u(1)                               if(                     ( collocated_from_10_flag && num_ref_entries[0][ PicRplsIdx[0] ] > 1) ||                                                     ( !collocated_from_10_flag && num_ref_entries[1][ PicRplsIdx[1] ] > 1) )        pic_collocated_ref_idx ue(v)    }   }

is changed to be as follows:

  if(sps_temporal_mvp_enabled_flag ) {    pic_temporal_mvp_enabled_flag u(1)    if(pic_temporal_mvp_enabled_flag && rpl_info_in_ph_flag ) {     pic_collocated_from_10_flag u(1)     if( ( collocated_from_10_flag &&  NumRefIdxActive[0]  > 1) ||       ( !collocated_from_10_flag &&  NumRefIdxActive[1]  > 1) )      pic_collocated_ref_idx ue(v)    }   }

32. The WP table syntax is changed from the following (where the yellow highlights are new compared to the latest VVC draft text in JVET-Q0041-v2):

pred_weight_table( ) { Descriptor  luma_log2_weight_denom ue(v)  if(ChromaArrayType != 0)   delta_chroma_log2_weight_denom se(v)   if(wp info in ph flag )    num 10 weights ue(v)  for( i = 0; i <  num 10 weights ; i++ )   luma_weight_10_flag[i] u(1)  if(ChromaArrayType != 0 )   for( i = 0; i <  num 10 weights ; i++ )    chroma_weight_10_flag[ i ] u(1)  for( i = 0; i <  num 10 weights ; i++ ) {   if(luma_weight_10_flag[ i ] ) ) {     delta_luma_weight_10 [ i ] se(v)     luma_offset_10 [ i ] se(v)   }   if(chroma_weight_10_flag[ i ] )    for( j = 0; j < 2; j++ ) {      delta_chroma_weight_10 [ i ][ j ] se(v)      delta_chroma_offset_10 [ i ][ j ] se(v)    }   }  if(slice_type = = B ) {    if(wp info in ph flag)     num l1 weights ue(v)   for( i = 0; i <  num l1 weights ; i++ )     luma_weight_11_flag [ i ] u(1)   if(ChromaArrayType != 0 )    for( i = 0; i <  num l1 weights ; i++ )      chroma_weight_l1_flag [ i ] u(1)    for( i = 0; i <  num l1 weights ; i++ ) {     if(luma_weight_11_flag[ i ] ) {      delta_luma_weight_11[ i ] se(v)      luma_offset_l1[ i ] se(v)    }    if(chroma_weight_11_flag[i] )     for( j = 0; j < 2; j++ ) {      delta_chroma_weight_l1[ i ][ j ] se(v)      delta_chroma_offset_l1[ i ][ j ] se(v)     }    }   }  }

To be as follows (i.e., the same as in JVET-Q0041-v2):

pred_weight_table( ) { Descriptor luma_log2_weight_denom ue(v) if(ChromaArrayType != 0 ) delta_chroma_log2_weight_denom se(v) for( i = 0; i < NumRefIdxActive[ 0 ]; i++ ) luma_weight_10_flag[ i ] u(1) if(ChromaArrayType != 0 ) for( i = 0; i < NumRefIdxActive[ 0 ]; i++ ) chroma_weight_10_flag[ i ] u(1) for( i = 0; i < NumRefIdxActive[ 0 ]; i++ ) { if(luma_weight_10_flag[ i ] ) ) { delta_luma_weight_10[ i ] se(v) luma_offset_10[ i ] se(v) } if(chroma_weight_10_flag[ i ] ) for( j = 0; j < 2; j++ ) { delta_chroma_weight_10[ i ][ j ] se(v) delta_chroma_offset_10[ i ][ j ] se(v) } } if(slice_type = = B ) { for( i = 0; i < NumRefIdxActive[ 1 ]; i++ ) luma_weight_11_flag[ i ] u(1) if(ChromaArrayType != 0 ) for( i = 0; i < NumRefIdxActive[ 1 ]; i++ ) chroma_weight_l1_flag[ i ] u(1) for( i = 0; i < NumRefIdxActive[ 1 ]; i++ ) { if(luma_weight_11_flag[ i ] ) { delta_luma_weight_11[ i ] se(v) luma_offset_l1[ i ] se(v) } if(chroma_weight_11_flag[ i ] ) for( j = 0; j < 2; j++ ) { delta_chroma_weight_l1[ i ][ j ] se(v) delta_chroma_offset_l1[ i ][ j ] se(v) } } } }

33. In one example, bullets 30, 31, 32 may be used together as a combined solution.

-   a. Alternatively, the change in item 30 above is not made (i.e.,     when RPL info is in the SH, the numbers of active entries are still     signaled in SHs), when WP table is signaled in the slice headers     (i.e., when wp_info_in_ph_flag is equal to 0), but it is constrained     that all slices of the picture may have the same value for     NumRefldxActive[ 0 ] and may have the same value for     NumRefldxActive[ 0 ], and the WP syntax table is also changed to be     the same as in the latest VVC draft text in JVET-Q0041-v2.

34. For above examples, the number of weights to be signaled may not be directly coded, instead, the differences between the number of weights and a threshold K (e.g., K=1) may be coded in the bitstream.

-   a. In one example, the num_10_weights in the WP table should be     coded as num_10_weights_minus1 (that is, the number minus 1 is     coded), and the syntax table is changed accordingly. -   b. Alternatively, predictive coding of the number of weights for     list X may be utilized, such as differences between the number of     weights for list 0 and list 1 may be coded.

Clipping for ACT Residuals

35. When inverse ACT is applied on a block, the input of inverse ACT at the decoder may be clipped based on (BitDepth+K), where BitDepth denotes the bit depth of a block (e.g., the internal bit depth, which may be denoted by bit_depth_minus8) and K is unequal to 0.

-   a. In one example, the clipping operation may be denoted by f (a,     b, x) wherein x denotes the value to be clipped, and a is the lowest     bound of the x and b is the highest bound of the x.     -   i. In one example, f (a, b, x) may be equal to ( x < a ? a : (         x> b ? b : x ) ).     -   ii. In one example, a may be set equal to - (1 < < (BitDepth +         K)).     -   iii. In one example, b may be set equal to (1 << (BitDepth +         K)) - 1. -   b. In one example, K may be set equal to 1.     -   i. Alternatively, K may be set equal to 0. -   c. In one example, clipping based on (BitDepth + K) may be only     applied to the 2nd and/or 3rd colour components.

36. When inverse ACT is applied on a block, clipping of input for the inverse ACT may not be applied to the 1st colour or luma component.

37. The output of inverse ACT may be clipped based on the internal bit depth, i.e. BitDepth.

-   a. The clipping operation may denote the operation described in     bullet 22.a with K set equal to 0. -   b. The clipping may be only applied on the 1st or luma colour     component. -   c. The clipping may be only applied on the 2nd and 3rd colour     components.

General Embodiments ((Items 20-21)

38. In the above examples, S₁, S₂, 1, h, m, n and/or k are integer numbers and may depend on

-   a. A message signaled in the decoding parameter set (DPS)/SPS/video     parameter set (VPS)/PPS/adaption parameter set (APS) /picture     header/slice header/tile group header/ Largest coding unit     (LCU)/Coding unit (CU)/LCU row/group of LCUs/TU/PU block/Video     coding unit -   b. Position of CU/PU/TU/block/Video coding unit -   c. Coded modes of blocks containing the samples along the edges -   d. Transform matrices applied to the blocks containing the samples     along the edges -   e. Block dimension/Block shape of current block and/or its     neighboring blocks -   f. Indication of the colour format (such as 4:2:0, 4:4:4, RGB or     YUV) -   g. Coding tree structure (such as dual tree or single tree) -   h. Slice/tile group type and/or picture type -   i. Colour component (e.g. may be only applied on Cb or Cr) -   j. Temporal layer ID -   k. Profiles/Levels/Tiers of a standard -   l. Alternatively, S₁, S₂, 1, h, m, n and/or k may be signaled to the     decoder.

39. The above proposed methods may be applied under certain conditions.

-   a. In one example, the condition is the colour format is 4:2:0     and/or 4:2:2. -   b. In one example, indication of usage of the above methods may be     signaled in sequence/picture/slice/tile/brick/a video region-level,     such as SPS/PPS/picture header/slice header. -   c. In one example, the usage of the above methods may depend on     -   i. Video contents (e.g. screen contents or natural contents)     -   ii. A message signaled in the DPS/SPS/VPS/PPS/APS/picture         header/slice header/tile group header/ Largest coding unit         (LCU)/Coding unit (CU)/LCU row/group of LCUs/TU/PU block/Video         coding unit     -   iii. Position of CU/PU/TU/block/Video coding unit     -   iv. Coded modes of blocks containing the samples along the edges     -   v. Transform matrices applied to the blocks containing the         samples along the edges     -   vi. Block dimension of current block and/or its neighboring         blocks     -   vii. Block shape of current block and/or its neighboring blocks     -   viii. Indication of the colour format (such as 4:2:0, 4:4:4, RGB         or YUV)     -   ix. Coding tree structure (such as dual tree or single tree)     -   x. Slice/tile group type and/or picture type     -   xi. Colour component (e.g. may be only applied on Cb or Cr)     -   xii. Temporal layer ID     -   xiii. Profiles/Levels/Tiers of a standard     -   xiv. Alternatively, m and/or n may be signaled to the decoder.

5. Embodiments

The embodiments are based on JVET-P2001-vE. The newly added texts are highlight by bold italicized underlined text. The deleted texts are marked by italicized text.

5.1. Embodiment #1

This embodiment is related to the interaction between ACT and BDPCM modes.

coding_unit( x0, y0, cbWidth, cbHeight, cqtDepth, treeType, modeType ) { Descriptor chType = treeType = = DUAL TREE CHROMA ? 1 : 0 ... if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA && sps_palette_enabled_flag && cbWidth <= 64 && cbHeight <= 64 && cu_skip_flag[ x0 ][ y0 ] = = 0 && modeType != MODE_TYPE_INTER ) pred_mode_plt_flag ae(v) } if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA && sps_act_enabled_flag && treeType = = SINGLE_TREE) cu_act_enabled_flag ae(v) if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA || CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_PLT ) { if( treeType = = SINGLE_TREE || treeType = = DUAL_TREE_LUMA) { if( pred_mode_plt_flag ) { palette_coding( x0, y0, cbWidth, cbHeight, treeType ) } else { if( sps_bdpcm_enabled_flag && cbWidth <= MaxTsSize && cbHeight <= MaxTsSize && !cu act enabled flag ) intra_bdpcm_luma_flag ae(v) if( intra_bdpcm_luma_flag ) intra_bdpcm_luma_dir_flag ae(v) else { ... } } } ... }

5.2. Embodiment #2

This embodiment is related to the interaction between ACT and BDPCM modes.

intra_bdpcm_chroma_flag equal to 1 specifies that BDPCM is applied to the current chroma coding blocks at the location ( x0, y0 ), i.e. the transform is skipped, the intra chroma prediction mode is specified by intra_bdpcm_chroma_dir_flag. intra_bdpcm_chroma_flag equal to 0 specifies that BDPCM is not applied to the current chroma coding blocks at the location ( x0, y0 ).

When intra_bdpcm_chroma_flag is not present and cu act enabled flag is false, it is inferred to be equal to 0.

When intra bdpcm chroma flag is not present and cu act enabled flag is true, it is inferred to be equal to intra bdpcm luma tla_(f!.)

The variable BdpcmFlag[ x ][ y ][ cIdx ] is set equal to intra_bdpcm_chroma_flag for x = x0..x0 + cbWidth — 1, y = y0..y0 + cbHeight — 1 and cIdx = 1..2.

intra_bdpcm_chroma_dir_flag equal to 0 specifies that the BDPCM prediction direction is horizontal. intra_bdpcm_chroma_dir_flag equal to 1 specifies that the BDPCM prediction direction is vertical. When cu act enabled flag is true, intra bdpcm chroma dir flag is set equal to intra bdpcm luma dir flag.

The variable BdpcmDir[ x ][ y ][ cIdx ] is set equal to intra_bdpcm_chroma_dir_flag for x = x0..x0 + cbWidth — 1, y = y0..y0 + cbHeight — 1 and cIdx = 1..2.

5.3. Embodiment #3

This embodiment is related to the QP setting.

8.7.3 Scaling Process for Transform Coefficients

Inputs to this process are:

-   a luma location ( xTbY, yTbY ) specifying the top-left sample of the     current luma transform block relative to the top-left luma sample of     the current picture, -   a variable nTbW specifying the transform block width, -   a variable nTbH specifying the transform block height, -   a variable predMode specifying the prediction mode of the coding     unit, -   a variable cIdx specifying the colour component of the current     block.

Output of this process is the (nTbW)x(nTbH) array d of scaled transform coefficients with elements d[ x ][ y ].

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     {\text{qP = qP} - \left( {\text{cu\_act\_enabled\_flag}\left\lbrack \text{xTbY} \right\rbrack\left\lbrack \text{yTbY} \right\rbrack?\mspace{6mu} 5:0} \right)} & \text{­­­(1133)}     \end{matrix}$ -   qP = Clip3(0, 63, qP) -   $\begin{matrix}     {\text{rectNonTsFlag =}\left( {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right) = \mspace{6mu} = 1} \right)?\mspace{6mu} 1:0} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = BitDepth + rectNonTsFlag +} & \text{­­­(1135)}     \end{matrix}$ -   ( ( Log2( nTbW) + Log2( nTbH ) ) / 2 ) — 5 +     pic_dep_quant_enabled_flag -   Otherwise (transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to     1), the following applies: -   $\begin{matrix}     {qP = Max\left( {QpPrimeTsMin,qP} \right) - \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?\mspace{6mu} 5:0} \right)} & \text{­­­(1136)}     \end{matrix}$ -   $\begin{matrix}     \frac{qP = Max\left( {QpPrimeTsMin,qP\text{-}\left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?\mspace{6mu} 5:0} \right)} \right)}{\text{rectNonTsFlag = 0}} & \text{­­­(1137)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = 10} & \text{­­­(1138)}     \end{matrix}$ -   ...

5.4. Embodiment #4 8.7.1 Derivation Process for Quantization Parameters

...

-   The chroma quantization parameters for the Cb and Cr components,     Qp′Cb and Qp′Cr, and joint Cb-Cr coding Qp′CbCr are derived as     follows: -   $\begin{matrix}     \begin{array}{l}     \text{Qp'Cb = Clip3} \\     \left( {- \text{QpBdOffset, 63, qPCb + pps\_cb\_qp\_offset + slice\_cb\_qp\_offset + CuQpOffsetCb}} \right) \\     {+ \text{QpBdOffset}}     \end{array} & \text{­­­(1122)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     {\text{Q}\text{p}^{\prime}\text{Cr = Clip3}\left( {- \text{QpBdOffset, 63, qPCr + pps\_cr\_qp\_offset +}} \right)} \\     \left( \text{slice\_cr\_qp\_offset + CuQpOffsetCr} \right) \\     {+ \text{QpBdOffset}}     \end{array} & \text{­­­(1123)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     {\text{Q}\text{p}^{\prime}\text{CbCr =}} \\     {\text{Clip3}\left( {- \text{QpBdOffset, 63, qPCbCr + pps\_joint\_cbcr\_qp\_offset +}} \right)} \\     {\left( \text{slice\_joint\_cbcr\_qp\_offset +CuQpOffsetCbCr} \right) + \text{QpBdOffset}}     \end{array} & \text{­­­(1124)}     \end{matrix}$

5.5. Embodiment #5

7.3.9.5 Coding unit syntax coding_unit( x0, y0, cbWidth, cbHeight, cqtDepth, treeType, modeType ) { Descriptor chType = treeType = = DUAL TREE CHROMA ? 1 : 0 ... if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA && sps_act_enabled_flag && treeType = = SINGLE_TREE && cbWidth <= K0 && cbHeight <= K1 ) cu_act_enabled_flag ae(v) ... if( cu_cbf ) { if( sps_act_enabled_flag && CuPredMode[ chType ][ x0 ][ y0 ] != MODE_INTRA && treeType = = SINGLE_TREE && cbWidth <= K0 && cbHeight <= K1 ) cu_act_enabled_flag ae(v) ... } } K0 and K1 are set equal to 32.

5.6. Embodiment #6

7.3.9.5 Coding unit syntax coding_unit( x0, y0, cbWidth, cbHeight, cqtDepth, treeType, modeType ) { Descriptor chType = treeType = = DUAL TREE CHROMA ? 1 : 0 ... if( CuPredMode[ chType ][ x0 ][ y0 ] = = MODE_INTRA && sps_act_enabled_flag && treeType = = SINGLE_TREE && cb Width <= MaxTbSizeY && cbHeight <= MaxTbSizeY ) cu_act_enabled_flag ae(v) ... if( cu_cbf ) { if( sps_act_enabled_flag && CuPredMode[ chType ][ x0 ][ y0 ] != MODE_INTRA && treeType = = SINGLE_TREE && cbWidth <= MaxTbSizeY && cbHeight <= MaxTbSizeY ) cu_act_enabled_flag ae(v) ... } }

5.7. Embodiment #7 8.7.3 Scaling Process for Transform Coefficients

Inputs to this process are:

-   a luma location ( xTbY, yTbY ) specifying the top-left sample of the     current luma transform block relative to the top-left luma sample of     the current picture, -   a variable nTbW specifying the transform block width, -   a variable nTbH specifying the transform block height, -   a variable predMode specifying the prediction mode of the coding     unit, -   a variable cIdx specifying the colour component of the current     block.

Output of this process is the (nTbW)x(nTbH) array d of scaled transform coefficients with elements d[ x ][ y ].

-   If cIdx is equal to 0, the following applies: -    A c t Q P o f f s e t = -5 qP = Q p ′ Y ­­­(1129) -   Otherwise, if TuCResMode[ xTbY ][ yTbY ] is equal to 2, the     following applies: -    A c t Q P o f f s e t = -6 qP = Q p ′ CbCr ­­­(1130) -   Otherwise, if cIdx is equal to 1, the following applies: -    A c t Q P o f f s e t = -5 qP = Q p ′ Cb ­­­(1131) -   Otherwise (cIdx is equal to 2), the following applies: -    A c t Q P o f f s e t = -3 qP = Q p ′ Cr ­­­(1132)

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     {qP = qP - \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?5:0} \right)} & \text{­­­(1133)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     {qP =} \\     {Max\left( {0,qP - \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?ActQPoffset:0} \right)} \right)} \\     \text{rectNonTsFlag =} \\     {\left( {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right) = = 1} \right)?1:0}     \end{array} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = BitDepth + rectNonTsFlag +} & \text{­­­(1135)}     \end{matrix}$ -   ( ( Log2( nTbW) + Log2( nTbH ) ) / 2 ) — 5 +     pic_dep_quant_enabled_flag -   Otherwise (transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to     1), the following applies: -   $\begin{matrix}     \begin{array}{l}     {qP =} \\     {Max\left( {QpPrimeTsMin,qP} \right) -} \\     \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?5:0} \right)     \end{array} & \text{­­­(1136)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     {qP = Max\left( {Qp\Pr imeTsMin,qP -} \right)\left( {cu\_ act\_ enabled\_ flag} \right)} \\     \left( {\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?ActQPoffset:(0)} \right) \\     \text{rectNonTsFlag = 0}     \end{array} & \text{­­­(1137)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = 10} & \text{­­­(1138)}     \end{matrix}$

The variable bdOffset is derived as follows:

$\begin{matrix} {\text{bdOffset =}\left( {1 < < \text{bdShift}} \right) > > 1} & \text{­­­(1139)} \end{matrix}$

The list levelScale[ ][ ] is specified as levelScale[ j ][ k] = { { 40, 45, 51, 57, 64, 72 }, { 57, 64, 72, 80, 90, 102 } } with j = 0..1, k = 0..5.

... 5.8. Embodiment #8 8.7.3 Scaling Process for Transform Coefficients

Inputs to this process are:

-   a luma location ( xTbY, yTbY ) specifying the top-left sample of the     current luma transform block relative to the top-left luma sample of     the current picture, -   a variable nTbW specifying the transform block width, -   a variable nTbH specifying the transform block height, -   a variable predMode specifying the prediction mode of the coding     unit, -   a variable cIdx specifying the colour component of the current     block.

Output of this process is the (nTbW)x(nTbH) array d of scaled transform coefficients with elements d[ x ][ y ].

-   If cIdx is equal to 0, the following applies: -   $\begin{matrix}     {qP = Qp^{\prime}Y} & \text{­­­(1129)}     \end{matrix}$ -   qP = Max(0, Qp′Y - (cu act enabled flag[ xTb Y ][ yTbY ] ? -5 : 0)) -   Otherwise, if TuCResMode[ xTbY ][ yTbY ] is equal to 2, the     following applies:     -   If cu act enabled flag xTbY ][ vTbY ] is equal to 1, the         following applies: qP = Clip3( -QpBdOffset, 63, qPCbCr - 7 +         CuOpOffsetCbCr ) + OpBdOffset     -   Otherwise     -   $\begin{matrix}         {\text{qP = Q}\text{p}^{\prime}}_{\text{CbCr}} & \text{­­­(1130)}         \end{matrix}$ -   Otherwise, if cIdx is equal to 1, the following applies:     -   If cu act enabled flag xTbY ][ vTbY ] is equal to 1, the         following applies:         -   qP = Clip3( -QpBdOffset, 63, qPCb - 5 + CuQpOffsetCb ) +             OpBdOffset     -   Otherwise     -   $\begin{matrix}         {\text{qP = Q}\text{p}^{\prime}}_{\text{Cb}} & \text{­­­(1131)}         \end{matrix}$ -   Otherwise (cIdx is equal to 2), the following applies:     -   If cu act enabled flag] xTbY ][ yTbY ] is equal to 1, the         following applies:         -   qP = Clip3( -OvBdOffset, 63, qPCr — 3 +CuQpOffsetCr ) +             OpBdOffset     -   Otherwise     -   $\begin{matrix}         {\text{qP = Q}\text{p}^{\prime}}_{\text{Cr}} & \text{­­­(1132)}         \end{matrix}$

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     {qP = qP - \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?5:0} \right)} & \text{­­­(1133)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     \text{rectNonTsFlag =} \\     {\left( {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right) = = 1} \right)?1:0}     \end{array} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = BitDepth + rectNonTsFlag +} & \text{­­­(1135)}     \end{matrix}$ -   ( ( Log2( nTbW) + Log2( nTbH ) ) / 2 ) — 5 +     pic_dep_quant_enabled_flag -   Otherwise (transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to     1), the following applies: -   $\begin{matrix}     \begin{array}{l}     {qP = Max\left( {QpPrimeTsMin,qP} \right) - \left( {cu\_ act\_ enabled\_ flag} \right)} \\     \left( {\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?5:0} \right)     \end{array} & \text{­­­(1136)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     {qP = Max\left( {QpPrimeTsMin,qP} \right)} \\     \text{rectNonTsFlag = 0}     \end{array} & \text{­­­(1137)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = 10} & \text{­­­(1138)}     \end{matrix}$

The variable bdOffset is derived as follows:

$\begin{matrix} {\text{bdOffset =}\left( {1 < < \text{bdShift}} \right) > > 1} & \text{­­­(1139)} \end{matrix}$

The list levelScale[ ][ ] is specified as levelScale[ j ][ k] = { { 40, 45, 51, 57, 64, 72 }, { 57, 64, 72, 80, 90, 102 } } with j = 0..1, k = 0..5.

...

5.9. Embodiment #9 7.4.3.4 Picture Parameter Set RBSP Semantics

pps act y qp offset plus5, pps act cb qp offset plus5, pps act cr qp offset plus3 and pps act jcbcr qp offset plus6 are used to determine the offsets that are applied to the quantization parameter values qP derived in clause 8.6.2 for the luma, Cb and Cr components, respectively, when tu residual act flag xTbY ][ yTbY 1 is equal to 1. When not present, the values of pps act y qp offset plus5, pps act cb qp offset plus5 and pps act cr qp offset plus3 are inferred to be equal to 0.

The variable PpsActQpOffsetY is set equal to pps act y qp offset plus5 — 5.

The variable PpsActQpOffsetCb is set equal to pps act cb qp offset plus5 — 5.

The variable PpsActQpOffsetCr is set equal to pps act cb qp offset plus3 — 3.

The variable PpsActQpOffsetCbCr is set equal to pps act cb qp offset plus6 — 6.

8.7.3 Scaling Process for Transform Coefficients

Inputs to this process are:

-   a luma location ( xTbY, yTbY ) specifying the top-left sample of the     current luma transform block relative to the top-left luma sample of     the current picture, -   a variable nTbW specifying the transform block width, -   a variable nTbH specifying the transform block height, -   a variable predMode specifying the prediction mode of the coding     unit, -   a variable cIdx specifying the colour component of the current     block.

Output of this process is the (nTbW)x(nTbH) array d of scaled transform coefficients with elements d[ x ][ y ].

-   If cIdx is equal to 0, the following applies:     -   ActOPoffset = PpsActOpOffsetY     -   $\begin{matrix}         {\text{qP = Q}\text{p}^{\prime}}_{\text{Y}} & \text{­­­(1129)}         \end{matrix}$ -   Otherwise, if TuCResMode[ xTbY ][ yTbY ] is equal to 2, the     following applies:     -   ActOPoffset = PpsActOpOffsetCbCr     -   $\begin{matrix}         {\text{qP = Q}\text{p}^{\prime}}_{\text{CbCr}} & \text{­­­(1130)}         \end{matrix}$ -   Otherwise, if cIdx is equal to 1, the following applies:     -   ActOPoffset = PpsActOpOffsetCb     -   $\begin{matrix}         {\text{qP = Q}\text{p}^{\prime}}_{\text{Cb}} & \text{­­­(1131)}         \end{matrix}$ -   Otherwise (cIdx is equal to 2), the following applies:     -   ActOPoffset = PpsActOpOffsetCr     -   $\begin{matrix}         {\text{qP = Q}\text{p}^{\prime}}_{\text{Cr}} & \text{­­­(1132)}         \end{matrix}$

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     {qP = qP - \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?5:0} \right)} & \text{­­­(1133)}     \end{matrix}$ -   qP = Max(0, qP - (cu act enabled flag[ xTb Y ][ vTbY ] ? ActOPoffset     : 0)) -   $\begin{matrix}     {\text{rectNonTsFlag =}\left( {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right) = = 1} \right)?1:0} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = BitDepth + rectNonTsFlag +} & \text{­­­(1135)}     \end{matrix}$ -   ( ( Log2( nTbW) + Log2( nTbH ) ) / 2 ) - 5 +     pic_dep_quant_enabled_flag -   Otherwise (transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to     1), the following applies: -   $\begin{matrix}     \begin{array}{l}     {qP = Max\left( {QpPrimeTsMin,qP} \right) - \left( {cu\_ act\_ enabled\_ flag} \right)} \\     \left( {\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?5:0} \right)     \end{array} & \text{­­­(1136)}     \end{matrix}$ -   qP = Max( QpPrimeTsMin, qP - (cu act enabled flag[ xTbY ][ vTbY ] ?     ActOPoffset : 0) -   $\begin{matrix}     \text{rectNonTsFlag = 0} & \text{­­­(1137)}     \end{matrix}$ -   $\begin{matrix}     \text{bdShift = 10} & \text{­­­(1138)}     \end{matrix}$

The variable bdOffset is derived as follows:

$\begin{matrix} {\text{bdOffset =}\left( {1 < < \text{bdShift}} \right) > > 1} & \text{­­­(1139)} \end{matrix}$

The list levelScale[ ][ ] is specified as levelScale[ j ][k] = { { 40, 45, 51, 57, 64, 72 }, { 57, 64, 72, 80, 90, 102 } } with j = 0..1, k = 0..5. ...

5.10. Embodiment #10 7.4.3.4 Picture Parameter Set RBSP Semantics

pps act y qp offset plus5, pps act cb qp offset plus5, pps act cr qp offset plus3 and pps act cbcr qp offset plus7 are used to determine the offsets that are applied to the quantization parameter values qP derived in clause 8.6.2 for the luma, Cb and Cr components, respectively, when tu residual act flag xTbY ][ yTbY ] is equal to 1. When not present, the values of pps act v qp offset plus5, pps act cb qp offset plus5 and pps act cr qp offset plus3 are inferred to be equal to 0.

The variable PpsActQpOffsetY is set equal to pps act y qp offset plus5 - 5.

The variable PpsActQpOffsetCb is set equal to pps act cb qp offset plus5 - 5.

The variable PpsActOpOffsetCr is set equal to pps act cb qp offset plus3 - 3.

The variable PpsActopOffsetCbCr is set equal to pps act cb qp offset plus7 - 7.

8.7.3 Scaling Process for Transform Coefficients

Inputs to this process are:

-   a luma location ( xTbY, yTbY ) specifying the top-left sample of the     current luma transform block relative to the top-left luma sample of     the current picture, -   a variable nTbW specifying the transform block width, -   a variable nTbH specifying the transform block height, -   a variable predMode specifying the prediction mode of the coding     unit, -   a variable cIdx specifying the colour component of the current     block.

Output of this process is the (nTbW)x(nTbH) array d of scaled transform coefficients with elements d[ x ][ y ].

-   If cIdx is equal to 0, the following applies: -   $\begin{matrix}     {qP = Qp^{\prime}Y} & \text{­­­(1129)}     \end{matrix}$

qP = Max(0, Qp Ύ - (cu act enabled flag[ xTbY ][ yTbY ] ? PpsActQpOffsetY : 0))

-   Otherwise, if TuCResMode[ xTbY ][ yTbY ] is equal to 2, the     following applies:     -   - If cu act enabled flag xTbY ][ vTbY 1 is equal to 1, the         following applies:         -   qP = Clip3( -QpBdOffset, 63, qPCbCr - PpsActOpOffsetCbCr +             CuOpOffsetCbCr ) + OpBdOffset -   Otherwise -   $\begin{matrix}     {\text{qP}\text{=}{\text{Q}\text{p}^{\prime}}_{\mspace{6mu}\text{CbCr}}} & \text{­­­(1130)}     \end{matrix}$ -   Otherwise, if cIdx is equal to 1, the following applies:     -   If cu_act_enabled_flag[xTbY][yTbY] is equal to 1, the following         applies:     -   $\begin{array}{l}         {qP\mspace{6mu}\mspace{6mu} = \mspace{6mu}\mspace{6mu} Clip3\left( {- QpBdOffset,\mspace{6mu} 63,\mspace{6mu} qPCb - \mspace{6mu}\mspace{6mu}\mspace{6mu} PpsActQpOffsetCb\mspace{6mu} +} \right)} \\         {\left( {CuQpOffsetCb} \right) + QpBdOffset}         \end{array}$     -   Otherwise     -   $\begin{matrix}         {\text{qP}\text{=}{\text{Q}\text{p}^{\prime}}_{\mspace{6mu}\text{Cb}}} & \text{­­­(1131)}         \end{matrix}$ -   Otherwise (cIdx is equal to 2), the following applies:     -   If cu act enabled flag[xTbY][vTbY] is equal to 1, the following         applies:         -   qP = Clip3(-QpBdOffset, 63, qPCr - PpsActOpOffsetCr             +CuQpOffsetCr) + OpBdOffset     -   Otherwise     -   $\begin{matrix}         {\text{qP}\text{=}{\text{Q}\text{p}^{\prime}}_{\mspace{6mu}\text{Cr}}} & \text{­­­(1132)}         \end{matrix}$

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[xTbY][yTbY][cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     {qP = qP - \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack\mspace{6mu}?\mspace{6mu} 5:0} \right)} & \text{­­­(1133)}     \end{matrix}$ -   $\begin{matrix}     {\text{rectNonTsFlag}\text{=}\left( {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right) = \mspace{6mu} = 1} \right)?\mspace{6mu} 1:0} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     {\text{bdShift}\text{=}\text{BitDepth + rectNonTsFlag}\text{+}} & \text{­­­(1135)}     \end{matrix}$ -   ((Log2(nTbW) + Log2(nTbH ) ) / 2 ) - 5 + pic_dep_quant_enabled_flag -   Otherwise (transform_skip_flag[ xTbY ][yTbY ][cIdx ] is equal to 1),     the following applies: -   $\begin{matrix}     \begin{array}{l}     {qP = Max\left( {QpPrimeTsMin,qP} \right) -} \\     \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack\mspace{6mu}?\mspace{6mu} 5:0} \right)     \end{array} & \text{­­­(1136)}     \end{matrix}$ -   qP = Max( QpPrimeTsMin, qP ) -   $\begin{matrix}     {\text{rectNonTsFlag}\text{=}\text{0}} & \text{­­­(1137)}     \end{matrix}$ -   $\begin{matrix}     {\text{bdShift}\text{=}\text{10}} & \text{­­­(1138)}     \end{matrix}$

The variable bdOffset is derived as follows:

$\begin{matrix} {\text{bdOffset}\text{=}\left( {1 < < \text{bdShift}} \right) > > 1} & \text{­­­(1139)} \end{matrix}$

The list levelScale[ ][ ] is specified as levelScale[ j ][k] = { { 40, 45, 51, 57, 64, 72 }, { 57, 64, 72, 80, 90, 102 } } with j = 0..1, k = 0..5.

5.11. Embodiment #11

Syntax change in PPS:  act_enabled_flag u(1)  if( act_enabled_flag ) {   pps_slice_act_qp_offset_present_flag u(1)   pps act y qp offset se(v)   pps_act_cb_qp_offset se(v)   pps_act_cr_qp_offset se(v)   joint cbcr enabled flag u(1)   if( pps_joint_cbcr_qp_offset_present_flag && joint_cber_enabled_flag)     pps_act_cber_qp_offset se(v)  }

Syntax change in slice header:  if(pps_slice_act_qp_offset_present_flag && !( slice_type == I && qtbtt-dual-tree-intra-flag) ) {   slice_act_y_qp_offset se(v)   slice_act_cb_qp_offset se(v)   slice_act_cr_qp_offset se(v)   if( pps_joint_cbcr_qp_offset_present_flag                && sps_joint_cbcr_enabled_flag)    slice_act_cber_qp_offset se(v)   } pps_act_y_qp_offset, pps_act_cb_qp_offset, pps_act_cr_qp_offset and pps_act_cbcr_qp_offset specify the offsets to quantization parameter Qp′Y, Qp′Cb, Qp′Cr and Qp′CbCr, respectively, when cu_act_enabled_flag is 1. The values of pps_act_y_qp_offset, pps_act_cb_qp_offset and pps_act_cr_qp_offset may be in the range of -12 to +12, inclusive. When not present, the values of pps_act_y_qp_offset, pps_act_cb_qp_offset and pps_act_cr_qp_offset are inferred to be equal to 0. pps_slice_act_qp_offsets_present_flag equal to 1 specifies that slice_act_y_qp_offset, slice_act _cb_qp_offset, slice_act_cr_qp_offset, slice_act_cbcr_qp_offset are present in the slice header. pps_slice_act_qp_offsets_present_flag equal to 0 specifies that slice_act_y_qp_offset, slice_act _cb_qp_offset, slice_ act _cr_qp_offset, slice_act_cber_qp_offset are not present in the slice header. When not present, the value of pps_slice_act_qp_offsets_present_flag is inferred to be equal to 0. slice_act_y_qp_offset, slice_act_cb_qp_offset, slice_act_cr_qp_offset and slice_act_cber_qp_offset specify the offsets when determining the value of the Qp′Y, Qp′Cb, Qp′Cr and Qp′CbCr quantization parameter. The values of slice_act_y_qp_offset, slice_act_cb_qp_offset, slice_act_cr_qp_offset and slice_act_cbcr_qp_offset may be in the range of -12 to +12, inclusive. When not present, the values are inferred to be equal to 0.

8.7.1 Derivation Process for Quantization Parameters

The variable Qpy is derived as follows:

$\begin{matrix} \begin{matrix} {\text{Qp}_{\text{Y}} =} \\ {\left( \left( {\text{qP}_{\text{Y\_PRED}} + \text{CuQpDeltaVal}\mspace{6mu} + \,\left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack} \right)} \right) \right)\mspace{6mu}?} \\ \left( {pps\_ act\_ y\_ qp\_ offset\text{+}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu} slice\_ act\_ y\_ qp\_ offset} \right) \\ {\text{+}\mspace{6mu}\text{64}\mspace{6mu}\text{+2∗}\left( \text{QpBdOffset} \right)\%\left( \left( {64\mspace{6mu} + \mspace{6mu}\text{QpBdOffset}} \right) \right) - \text{QpBdOffset}} \end{matrix} & \text{­­­(1116)} \end{matrix}$

The luma quantization parameter Qp′_(Y) is derived as follows:

$\begin{matrix} {{\text{Q}\text{p}^{\prime}}_{\mspace{6mu}\text{Y}} = \text{Qp}_{\text{Y}} + \text{QpBdOffset}} & \text{­­­(1117)} \end{matrix}$

When ChromaArrayType is not equal to 0 and treeType is equal to SINGLE_TREE or DUAL_TREE_CHROMA, the following applies:

-   When treeType is equal to DUAL_TREE_CHROMA, the variable Qp_(Y) is     set equal to the luma quantization parameter Qp_(Y) of the luma     coding unit that covers the luma location -   (xCb+cbWidth / 2, yCb + cbHeight/2). -   The variables qP_(Cb), qP_(Cr) and qP_(CbCr) are derived as follows: -   $\begin{matrix}     {\text{qP}_{\text{Chroma}} = \text{Clip3}\left( {- \text{QpBdOffset, 63, Qp}_{\text{Y}}} \right)} & \text{­­­(1118)}     \end{matrix}$ -   $\begin{matrix}     {\text{qP}_{\text{Cb}} = \text{ChromaQpTable}\lbrack 0\rbrack\left\lbrack \text{qP}_{\text{Chroma}} \right\rbrack} & \text{­­­(1119)}     \end{matrix}$ -   $\begin{matrix}     {\text{qP}_{\text{Cr}} = \text{ChromaQpTable}\lbrack 1\rbrack\left\lbrack \text{qP}_{\text{Chroma}} \right\rbrack} & \text{­­­(1120)}     \end{matrix}$ -   $\begin{matrix}     {\text{qP}_{\text{CbCr}} = \text{ChromaQpTable}\lbrack 2\rbrack\left\lbrack \text{qP}_{\text{Chroma}} \right\rbrack} & \text{­­­(1121)}     \end{matrix}$ -   The chroma quantization parameters for the Cb and Cr components,     Qp′_(Cb) and Qp′_(Cr), and joint Cb-Cr coding Qp′_(CbCr) are derived     as follows: -   $\begin{matrix}     \begin{matrix}     {\text{Q}\text{p}^{\prime}\mspace{6mu}_{\text{Cb}} = \text{Clip3}} \\     {\left( {- \text{QpBdOffset,}\mspace{6mu}\text{63,}\mspace{6mu}\text{qP}_{\text{Cb}} + \text{pps\_cb\_qp\_offset}\text{+}\text{slice\_cb\_qp\_offset}} \right)\mspace{6mu} \pm} \\     {\left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack} \right)\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}?\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}} \\     {pps\_ act\_ cb\_ qp\_ offset +} \\     {\left( {slice\_ act\_ cb\_ qp\_ offset} \right)\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\left( {+ \text{CuQpOffset}_{\text{Cb}}} \right)} \\     {+ \text{QpBdOffset}}     \end{matrix} & \text{­­­(1122)}     \end{matrix}$ -    Q p ′   Cr = Clip3 − QpBdOffset, 63, qP Cr + pps_cr_qp_offset +     slice_cr_qp_offset c u _ a c t _ e n a b l e d _ f l a g x T b Y y T     b Y     ?     p p s _ a c t _ c r _ q p _ o f f s e t + s l i c e _     a c t _ c r _ q p _ o f f s e t + CuQpOffset Cr                                                                             +   QpBdOffset     ­­­(1123) -    Q p ′   CbCr = Clip3 − QpBdOffset, 63, qP CbCr +     pps_joint_cbcr_qp_offset +                                                   slice_joint_cbcr_qp_offset ± c u _ a c t _ e n a b l e d _ f l a     g x T b Y y T b Y     ?     p p s _ a c t _ c b c r _ g p _ o f f s     e t + s l i c e _ a c t _ c b c r _ q p _ o f f s e t + CuQpOffset     CbCr + QpBdOffset ­­­(1124)

8.7.3 Scaling Process for Transform Coefficients The Variable OpActOffset Is Set Equal to 5.

The quantization parameter qP is derived as follows:

-   If cIdx is equal to 0, the following applies: -   $\begin{matrix}     {\text{qP}\text{=}{\text{Q}\text{p}^{\prime}}_{\text{Y}}} & \text{­­­(1129)}     \end{matrix}$ -   Otherwise, if TuCResMode[ xTbY ][ yTbY ] is equal to 2, the     following applies: -   $\begin{matrix}     {\text{qP}\text{=}{\text{Q}\text{p}^{\prime}}_{\text{CbCr}}} & \text{­­­(1130)}     \end{matrix}$ -   Otherwise, if cIdx is equal to 1, the following applies: -   $\begin{matrix}     {\text{qP}\text{=}{\text{Q}\text{p}^{\prime}}_{\mspace{6mu}\text{Cb}}} & \text{­­­(1131)}     \end{matrix}$ -   Otherwise (cIdx is equal to 2), the following applies: -   $\begin{matrix}     {\text{qP}\text{=}{\text{Q}\text{p}^{\prime}}_{\mspace{6mu}\text{Cr}}} & \text{­­­(1132)}     \end{matrix}$ -   OpActOffset = 3

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[xTbY ][yTbY ][cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     \begin{matrix}     {\text{qP}\text{=}\text{Clip3}} \\     \left( {0,\mspace{6mu} 63 + \text{QpBdOffset, qP}\text{−}\left( {\text{cu\_act\_enabled\_flag}\left\lbrack \text{xTbY} \right\rbrack\left\lbrack \text{yTbY} \right\rbrack\mspace{6mu}?} \right)} \right) \\     {\text{QpActOffset}\left( \left( \text{5 : 0} \right) \right)}     \end{matrix} & \text{­­­(1133)}     \end{matrix}$ -   $\begin{matrix}     {\text{rectNonTsFlag}\text{=}\left( {\left( {\left( \text{Log2} \right)\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right)\left( {= \mspace{6mu} = 1} \right)\mspace{6mu}?\mspace{6mu} 1\mspace{6mu}:\mspace{6mu} 0} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     {\text{bdShift}\text{=}\text{BitDepth}\text{+}\text{rectNonTsFlag}\text{+}} & \text{­­­(1135)}     \end{matrix}$ -   ( ( Log2(nTbW) + Log2(nTbH ) ) / 2 ) - 5 +     pic_dep_quant_enabled_flag -   Otherwise (transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to     1), the following applies: -   $\begin{matrix}     \begin{array}{l}     {qP\mspace{6mu} =} \\     {Max\left( {QpPrimeTsMin,qP} \right) -} \\     {\left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?\mspace{6mu} 5\mspace{6mu}:\mspace{6mu} 0} \right)(1136)} \\     {qP\mspace{6mu}\mspace{6mu}\mspace{6mu} = \mspace{6mu}\mspace{6mu}\mspace{6mu} Clip3\left( {QpPrimeTsMin,\mspace{6mu}\mspace{6mu}\mspace{6mu} 63 +} \right)} \\     {QpBdOffset,\mspace{6mu} qP -} \\     \left( {cu\_ act\_ enabled\_ flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack?\mspace{6mu} QpActOffset\mspace{6mu}:\mspace{6mu} 0} \right) \\     \left( {\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}} \right)     \end{array} & \text{­­­(1136)}     \end{matrix}$

5.12. Embodiment #12

Syntax change in PPS:  pps_cb_qp_offset se(v)  pps_cr_qp_offset se(v)  pps_joint_cber_qp_offset_present_flag u(1)  if( pps_joint_cbcr_qp_offset_present_flag )   pps_joint_cbcr_qp_offset_value se(v)  pps_slice_chroma_qp_offsets_present_flag u(1)  pps_cu_chroma_qp_offset_list_enabled_flag u(1)  if( pps_cu_chroma_qp_offset_list_enabled_flag ) {   chroma_qp_offset_list_len_minus1 ue(v)   for( i = 0; i <= chroma_qp_offset_list_len_minus1; i++ ) {    cb_qp_offset_list[ i ] se(v)    cr_qp_offset_list[ i ] se(v)    if( pps_joint_cbcr_qp_offset_present_flag )     joint_cbcr_qp_offset_list[ i ] se(v)   }   }   pps act y qp offset se(v)   pps act cb qp offset se(v)   pps_act_cr_qp_offset se(v)   if( pps_joint_cbcr_qp_offset_present_flag )   pps act cbcr qp offset se(v)  pps_slice_act_qp_offset_present_flag u(1)

Syntax change in slice header:  if( pps_cu_chroma_qp_offset_list_enabled_flag )   cu_chroma_qp_offset_enabled_flag u(1)  if(pps slice act qp offset present flag && !( slice type == I && qtbtt_dual_tree_intra_flag) ) ) {   slice_act_y_qp_offset se(v)   slice act cb qp offset se(v)   slice act cr qp offset se(v)   if( pps_joint_cber_qp_offset_present_flag )   slice_act_cber_qp_offset se(v)  } pps_act_y_qp_offset, pps_act_cb_qp_offset, pps_act_cr_qp_offset and pps_act_cbcr_qp_offset specify the offsets to quantization parameter Qp′_(Y), Qp′_(Cb), Qp′_(Cr) and Qp′_(CbCr), respectively, when cu_act_enabled_flag is 1. The values of pps_act_y_qp_offset, pps_act_cb_qp_offset and pps_act_cr_qp_offset may be in the range of -12 to +12, inclusive. When not present, the values of pps_act_y_qp_offset, pps_act_cb_qp_offset and pps_act_cr_qp_offset are inferred to be equal to 0. pps_slice_act_qp_offsets_present_flag equal to 1 specifies that slice_act_y_qp_offset, slice_ act _cb_qp_offset, slice_act_cr_qp_offset, slice_act_cbcr_qp_offset are present in the slice header. pps_slice_act_qp_offsets_present_flag equal to 0 specifies that slice_act_y_qp_offset, slice_ act _cb_qp_offset, slice_ act _cr_qp_offset, slice_act_cber_qp_offset are not present in the slice header. When not present, the value of pps_slice_act_qp_offsets_present_flag is inferred to be equal to 0. slice_act_y_qp_offset, slice_act_cb_qp_offset, slice_act_cr_qp_offset and slice_act_cber_qp_offset specify the offsets when determining the value of the Qp′_(Y), Qp′_(Cb), Qp′_(Cr) and Qp′_(CbCr) quantization parameter. The values of slice_act_y_qp_offset, slice_act_cb_qp_offset, slice_act_cr_qp_offset and slice_act_cbcr_qp_offset may be in the range of -12 to +12, inclusive. When not present, the values are inferred to be equal to 0.

8.7.1 Derivation Process for Quantization Parameters

The variable Qpy is derived as follows:

$\begin{matrix} \begin{matrix} {\text{Qp}_{\text{Y}}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu} = \mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\mspace{6mu}\left( \left( {\text{qP}_{\text{Y\_PRED}} + \text{CuQpDeltaVal}} \right) \right)} \\ {+ 64 + 2*\left( \text{QpBdOffset} \right)\%\left( \left( {64 + \text{QpBdOffset}} \right) \right) - \text{QpBdOffset}} \end{matrix} & \text{­­­(1116)} \end{matrix}$

The luma quantization parameter Qp′_(Y) is derived as follows:

Q p ′ Y = Qp Y + c u _ a c t _ e n a b l e d _ f l a g x T b Y y T b Y ?   p p s _ a c t _ y _ g p _ o f f s e t + s l i c e _ a c t _ y _ g p _ o f f s e t : 0 + QpBdOffset ­­­(1117)

When ChromaArrayType is not equal to 0 and treeType is equal to SINGLE_TREE or DUAL_TREE_CHROMA, the following applies:

-   When treeType is equal to DUAL_TREE_CHROMA, the variable Qp_(Y) is     set equal to the luma quantization parameter Qp_(Y) of the luma     coding unit that covers the luma location -   (xCb +cbWidth/2, yCb +cbHeight/2.) -   The variables qP_(Cb), qP_(Cr) and qP_(CbCr) are derived as follows: -   $\begin{matrix}     {\text{qP}_{\text{Chroma}} = \text{Clip3}\left( {\text{−}\text{QpBdOffset,}\mspace{6mu}\text{63,}\mspace{6mu}\text{Qp}_{\text{Y}}} \right)} & \text{­­­(1118)}     \end{matrix}$ -   $\begin{matrix}     {\text{qP}_{\text{Cb}} = \text{ChromaQpTable}\lbrack 0\rbrack\left\lbrack \text{qP}_{\text{Chroma}} \right\rbrack} & \text{­­­(1119)}     \end{matrix}$ -   $\begin{matrix}     {\text{qP}_{\text{Cr}} = \text{ChromaQpTable}\left\lbrack {\mspace{6mu}\text{1}\mspace{6mu}} \right\rbrack\left\lbrack \text{qP}_{\text{Chroma}} \right\rbrack} & \text{­­­(1120)}     \end{matrix}$ -   $\begin{matrix}     {\text{qP}_{\text{CbCr}} = \text{ChromaQpTable}\left\lbrack {\mspace{6mu} 2\mspace{6mu}} \right\rbrack\left\lbrack \text{qP}_{\text{Chroma}} \right\rbrack} & \text{­­­(1121)}     \end{matrix}$ -   The chroma quantization parameters for the Cb and Cr components,     Qp′_(Cb) and Qp′_(Cr), and joint Cb-Cr coding Qp′_(CbCr) are derived     as follows:     -   If cu_act_enabled_flag[xTbY][yTbY] is equal to 1, the following         applies     -   $\begin{matrix}         \begin{array}{l}         {Qp\prime_{Cb} = Clip3\left( {- OpBdOffset,\mspace{6mu} 63,\mspace{6mu} qP_{Cb} + pps\text{\_}cb\text{\_}qp\text{\_}offset +} \right)} \\         {slice\text{\_}cb\text{\_}qp\text{\_}offet + pps\text{\_}act\text{\_}cb\text{\_}qp\text{\_}offset +} \\         {\left( {slice\text{\_}act\text{\_}cb\text{\_}qp\text{\_}offset + CuQpOffset_{Cb}} \right) + QpBdOffset} \\         {Qp\prime_{Cr} = Clip3( - )QpBdOffset,\mspace{6mu} 63,\mspace{6mu} qp_{Cr} + pps\text{\_}cr\text{\_}qp\text{\_}offset +} \\         {slice\text{\_}cr\text{\_}qp\text{\_}offset + pps\text{\_}act\text{\_}cr\text{\_}qp\text{\_}offset +} \\         {\left( {slice\text{\_}act\text{\_}cr\text{\_}qp\text{\_}offset + CuQpOffset_{Cr}} \right) + QpBdOffset} \\         {Qp\prime_{CbCr} = Clip3\left( {- QpBdOffset,\mspace{6mu} 63,\mspace{6mu} Qp_{CbCr} +} \right)} \\         {pps\text{\_}joint\text{\_}cbcr\text{\_}qp\text{\_}offset + slice\text{\_}joint\text{\_}cbcr\text{\_}qp\text{\_}offset +} \\         {pps\text{\_}act\text{\_}cbcr\text{\_}qp\text{\_}offset + slice\text{\_}act\text{\_}cbcr\text{\_}qp\text{\_}offset +} \\         {\left( {CuQpOffset_{CbCr}} \right) + QpBdOffset} \\         {Otherwise,\mspace{6mu} the\mspace{6mu} following\mspace{6mu} applies:} \\         {\text{Qp}\prime_{\text{Cb}} = \text{Clip}3\left( {- \text{QpBdOffset,}\mspace{6mu}\text{63,}\mspace{6mu}\text{qP}_{\text{Cb}} + \text{pps\_cb\_qp\_offset} +} \right)} \\         {\left( {\text{slice\_cb\_qp\_offset} + \text{CuQpOffset}_{\text{Cb}}} \right) + \text{QpBdOffset}}         \end{array} & \text{­­­(1122)}         \end{matrix}$     -   $\begin{matrix}         \begin{array}{l}         {\text{Qp}\prime_{\text{Cr}} = \text{Clip}3\left( {- \text{QpBdOffset,}\mspace{6mu}\text{63,}\mspace{6mu}\text{qP}_{\text{Cr}} + \text{pps\_cr\_qp\_offset} +} \right)} \\         {\left( {\text{slice\_cr\_qp\_offset} + \text{CuQpOffset}_{\text{Cr}}} \right) + \text{QpBdOffset}}         \end{array} & \text{­­­(1123)}         \end{matrix}$     -   $\begin{array}{l}         {\text{Qp}\prime_{\text{CbCr}} = \text{Clip}3\left( {- \text{QpBdOffset},\mspace{6mu} 63,\mspace{6mu}\text{qP}_{\text{CbCr}} +} \right)} \\         {\text{pps\_joint\_cbcr\_qp\_offset} + \text{slice\_joint\_cbcr\_qp\_offset} +} \\         {\left( \text{CuQpOffset}_{\text{CbCr}} \right) + \text{QpBdOffset}}         \end{array}$

8.7.3 Scaling Process for Transform Coefficients The Variable OpActOffset Is Set Equal to 5.

The quantization parameter qP is derived as follows:

-   If cIdx is equal to 0, the following applies: -   $\begin{matrix}     {\text{qP} = \text{Qp}\prime_{\text{Y}}} & \text{­­­(1129)}     \end{matrix}$ -   Otherwise, if TuCResMode[ xTbY ][ yTbY ] is equal to 2, the     following applies: -   $\begin{matrix}     {\text{qP} = \text{Qp}\prime_{\text{CbCr}}} & \text{­­­(1130)}     \end{matrix}$ -   Otherwise, if cIdx is equal to 1, the following applies: -   $\begin{matrix}     {\text{qP} = \text{Qp}\prime_{\text{Cb}}} & \text{­­­(1131)}     \end{matrix}$ -   Otherwise (cIdx is equal to 2), the following applies: -   $\begin{matrix}     {\text{qP} = \text{Qp}\prime_{\text{Cr}}} & \text{­­­(1132)}     \end{matrix}$ -   OpActOffset = 3

The quantization parameter qP is modified and the variables rectNonTsFlag and bdShift are derived as follows:

-   If transform_skip_flag[ xTbY ][ yTbY ][ cIdx ] is equal to 0, the     following applies: -   $\begin{matrix}     \begin{array}{l}     {\text{qP} = Clip3\left( {0,\mspace{6mu} 63 + QpBdOffset,\mspace{6mu}\text{qP} -} \right)} \\     \left( \left( {\text{cu\_act\_enabled\_flag}\left\lbrack \text{xTbY} \right\rbrack\left\lbrack \text{yTbY} \right\rbrack?\mspace{6mu} QpActOffset\mspace{6mu} 5:0} \right) \right)     \end{array} & \text{­­­(1133)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     {\text{recNonTsFlag}\quad =} \\     {\left( {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)\& 1} \right) = \mspace{6mu} = 1} \right)\mspace{6mu}?\mspace{6mu} 1:0}     \end{array} & \text{­­­(1134)}     \end{matrix}$ -   $\begin{matrix}     {\text{bdShift} = \text{BitDepth} + \text{rectNonTsFlag} +} & \text{­­­(1135)}     \end{matrix}$ -   $\begin{matrix}     \begin{array}{l}     {\left( {\left( {\text{Log2}\left( \text{nTbW} \right) + \text{Log2}\left( \text{nTbH} \right)} \right)/2} \right) - 5 +} \\     \text{pic\_dep\_quant\_enabled\_flag} \\     {\text{Otherwise}\left( {\text{transform\_skip\_flag}\left\lbrack \text{xTbY} \right\rbrack\left\lbrack \text{yTbY} \right\rbrack\left\lbrack \text{cIdx} \right\rbrack\mspace{6mu}\text{is}\mspace{6mu}\text{equal}\mspace{6mu}\text{to}\mspace{6mu} 1} \right),} \\     {\text{the}\mspace{6mu}\text{following}\,\text{applies}:} \\     {qP\quad =} \\     {Max\left( {QpPrimeTsMin,qP} \right) -} \\     {\left( {cu\text{\_}act\text{\_}enabled\text{\_}flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack\mspace{6mu}?\mspace{6mu} 5:0} \right)\left( {1136} \right)} \\     {qP\quad = \quad Max\left( {QpPrimeTsMin,qP -} \right)} \\     \left( \left( {cu\text{\_}act\text{\_}enabled\text{\_}flag\left\lbrack {xTbY} \right\rbrack\left\lbrack {yTbY} \right\rbrack\mspace{6mu}?\mspace{6mu} QpActOffset:0} \right) \right)     \end{array} & \text{­­­(1136)}     \end{matrix}$

5.13. Embodiment #13 8.7.4.6 Residual Modification Process for Blocks Using Colour Space Conversion

The (nTbW)x(nTbH) arrays of residual samples ry, r_(Cb) and r_(Cr) are modified as follows:

$\begin{matrix} \begin{array}{l} {r_{Y}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < \left( {BitDepth + 1} \right)} \right),\left( {1 < < \left( {BitDepth + 1} \right)} \right) -} \right)} \\ {\left( {1,r_{Y}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \\ {r_{Cb}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < \left( {BitDepth + 1} \right)} \right),\left( {1 < < \left( {BitDepth + 1} \right)} \right) -} \right)} \\ {\left( {1,r_{Cb}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \\ {r_{Cr}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < \left( {BitDepth + 1} \right)} \right),\left( {1 < < \left( {BitDepth + 1} \right)} \right) -} \right)} \\ {\left( {1,r_{Cr}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \\ {\text{tmp} = \text{r}_{\text{Y}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack - \left( {\text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack > > 1} \right)} \end{array} & \text{­­­(1191)} \end{matrix}$

$\begin{matrix} {\text{r}_{\text{Y}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = r_{Y}\lbrack x\rbrack\lbrack y\rbrack tmp + \text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack} & \text{­­­(1192)} \end{matrix}$

r_(Cb)[x][y] = tmp − (r_(Cr)[x][y] >  > 1)

$\begin{matrix} {\text{r}_{\text{Cr}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack \pm \text{=}\mspace{6mu} tmp + \text{-r}_{\text{Cr}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack} & \text{­­­(1193)} \end{matrix}$

(1194)

5.14. Embodiment #14 8.7.4.6 Residual Modification Process for Blocks Using Colour Space Conversion

The (nTbW)x(nTbH) arrays of residual samples ry, r_(Cb) and r_(Cr) are modified as follows:

$\begin{array}{l} {r_{Y}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < BitDepth} \right),\left( {1 < < BitDepth} \right) -} \right)} \\ {\left( {1,r_{Y}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \\ {r_{Cb}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < \left( {BitDepth + 1} \right)} \right),\left( {1 < < \left( {BitDepth + 1} \right)} \right) -} \right)} \\ {\left( {1,r_{Cb}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \\ {r_{Cr}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < \left( {BitDepth + 1} \right)} \right),\left( {1 < < \left( {BitDepth + 1} \right)} \right) -} \right)} \\ {\left( {1,r_{Cr}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \end{array}$

$\begin{matrix} {\text{tmp} = \text{r}_{\text{Y}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack - \left( {\text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack > > 1} \right)} & \text{­­­(1191)} \end{matrix}$

$\begin{matrix} {\text{r}_{\text{Y}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = r_{Y}\lbrack x\rbrack\lbrack y\rbrack tmp + \text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack} & \text{­­­(1192)} \end{matrix}$

$\begin{matrix} {\text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \text{tmp} - \left( {\text{r}_{\text{Cr}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack > > 1} \right)} & \text{­­­(1193)} \end{matrix}$

5.15. Embodiment #15 8.7.4.6 Residual Modification Process for Blocks Using Colour Space Conversion

The (nTbW)x(nTbH) arrays of residual samples ry, r_(Cb) and r_(Cr) are modified as follows:

$\begin{array}{l} {r_{Cb}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < \left( {BitDepth + 1} \right)} \right),\left( {1 < < \left( {BitDepth + 1} \right)} \right) -} \right)} \\ {\left( {1,r_{Cb}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \\ {r_{Cr}\lbrack x\rbrack\lbrack y\rbrack = Clip3\left( {- \left( {1 < < \left( {BitDepth + 1} \right)} \right),\left( {1 < < \left( {BitDepth + 1} \right)} \right) -} \right)} \\ {\left( {1,r_{Cr}\lbrack x\rbrack\lbrack y\rbrack} \right)\left( {xxxx} \right)} \end{array}$

$\begin{matrix} {\text{tmp} = \text{r}_{\text{Y}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack - \left( {\text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack > > 1} \right)} & \text{­­­(1191)} \end{matrix}$

$\begin{matrix} {\text{r}_{\text{Y}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = r_{Y}\lbrack x\rbrack\lbrack y\rbrack tmp + \text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack} & \text{­­­(1192)} \end{matrix}$

$\begin{matrix} {\text{r}_{\text{Cb}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack = \text{tmp} - \left( {\text{r}_{\text{Cr}}\left\lbrack \text{x} \right\rbrack\left\lbrack \text{y} \right\rbrack > > 1} \right)} & \text{­­­(1193)} \end{matrix}$

FIG. 7 is a block diagram showing an example video processing system 700 in which various embodiments disclosed herein may be implemented. Various implementations may include some or all of the components of the system 700. The system 700 may include input 702 for receiving video content. The video content may be received in a raw or uncompressed format, e.g., 8 or 10 bit multi-component pixel values, or may be in a compressed or encoded format. The input 702 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interface include wired interfaces such as Ethernet, passive optical network (PON), etc. and wireless interfaces such as Wi-Fi or cellular interfaces.

The system 700 may include a coding component 704 that may implement the various coding or encoding methods described in the present disclosure. The coding component 704 may reduce the average bitrate of video from the input 702 to the output of the coding component 704 to produce a coded representation of the video. The coding techniques are therefore sometimes called video compression or video transcoding techniques. The output of the coding component 704 may be either stored, or transmitted via a communication connected, as represented by the component 706. The stored or communicated bitstream (or coded) representation of the video received at the input 702 may be used by the component 708 for generating pixel values or displayable video that is sent to a display interface 710. The process of generating user-viewable video from the bitstream representation is sometimes called video decompression. Furthermore, while certain video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or DisplayPort, and so on. Examples of storage interfaces include serial advanced technology attachment (SATA), peripheral component interconnect (PCI), integrated drive electronics (IDE) interface, and the like. The embodiments described in the present disclosure may be embodied in various electronic devices such as mobile phones, laptops, smartphones or other devices that are capable of performing digital data processing and/or video display.

FIG. 8 is a block diagram of a video processing apparatus 800. The apparatus 800 may be used to implement one or more of the methods described herein. The apparatus 800 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on. The apparatus 800 may include one or more processors 802, one or more memories 804 and video processing hardware/circuitry 806. The processor(s) 802 may be configured to implement one or more methods described in the present disclosure (e.g., in FIGS. 5A and 5B). The memory (memories) 804 may be used for storing data and code used for implementing the methods and embodiments described herein. The video processing hardware 806 may be used to implement, in hardware circuitry, some embodiments described in the present disclosure. In some embodiments, the hardware 806 may be partly or entirely in the processors 802, e.g., a graphics processor.

FIG. 9 is a block diagram that illustrates an example video coding system 100 that may utilize the embodiments of this disclosure. As shown in FIG. 9 , video coding system 100 may include a source device 110 and a destination device 120. Source device 110 generates encoded video data which may be referred to as a video encoding device. Destination device 120 may decode the encoded video data generated by source device 110 which may be referred to as a video decoding device. Source device 110 may include a video source 112, a video encoder 114, and an input/output (I/O) interface 116.

Video source 112 may include a source such as a video capture device, an interface to receive video data from a video content provider, and/or a computer graphics system for generating video data, or a combination of such sources. The video data may comprise one or more pictures. Video encoder 114 encodes the video data from video source 112 to generate a bitstream. The bitstream may include a sequence of bits that form a coded representation of the video data. The bitstream may include coded pictures and associated data. The coded picture is a coded representation of a picture. The associated data may include sequence parameter sets, picture parameter sets, and other syntax structures. I/O interface 116 may include a modulator/demodulator (modem) and/or a transmitter. The encoded video data may be transmitted directly to destination device 120 via I/O interface 116 through network 130 a. The encoded video data may also be stored onto a storage medium/server 130 b for access by destination device 120.

Destination device 120 may include an I/O interface 126, a video decoder 124, and a display device 122.

I/O interface 126 may include a receiver and/or a modem. I/O interface 126 may acquire encoded video data from the source device 110 or the storage medium/ server 130 b. Video decoder 124 may decode the encoded video data. Display device 122 may display the decoded video data to a user. Display device 122 may be integrated with the destination device 120, or may be external to destination device 120 which be configured to interface with an external display device.

Video encoder 114 and video decoder 124 may operate according to a video compression standard, such as the High Efficiency Video Coding (HEVC) standard, Versatile Video Coding (VVM) standard and other current and/or further standards.

FIG. 10 is a block diagram illustrating an example of video encoder 200, which may be video encoder 114 in the system 100 illustrated in FIG. 9 .

Video encoder 200 may be configured to perform any or all of the embodiments of this disclosure. In the example of FIG. 10 , video encoder 200 includes a plurality of functional components. The embodiments described in this disclosure may be shared among the various components of video encoder 200. In some examples, a processor may be configured to perform any or all of the embodiments described in this disclosure.

The functional components of video encoder 200 may include a partition unit 201, a prediction unit 202 which may include a mode select unit 203, a motion estimation unit 204, a motion compensation unit 205, and an intra prediction unit 206; a residual generation unit 207; a transform unit 208; a quantization unit 209; an inverse quantization unit 210; an inverse transform unit 211; a reconstruction unit 212; a buffer 213; and an entropy encoding unit 214.

In other examples, video encoder 200 may include more, fewer, or different functional components. In an example, prediction unit 202 may include an intra block copy (IBC) unit. The IBC unit may perform prediction in an IBC mode in which at least one reference picture is a picture where the current video block is located.

Furthermore, some components, such as motion estimation unit 204 and motion compensation unit 205 may be highly integrated, but are represented in the example of FIG. 10 separately for purposes of explanation.

Partition unit 201 may partition a picture into one or more video blocks. Video encoder 200 and video decoder 300 may support various video block sizes.

Mode select unit 203 may select one of the coding modes, intra or inter, e.g., based on error results, and provide the resulting intra- or inter-coded block to a residual generation unit 207 to generate residual block data and to a reconstruction unit 212 to reconstruct the encoded block for use as a reference picture. In some examples, mode select unit 203 may select a combination of intra and inter prediction (CIIP) mode in which the prediction is based on an inter prediction signal and an intra prediction signal. Mode select unit 203 may also select a resolution for a motion vector (e.g., a sub-pixel or integer pixel precision) for the block in the case of inter-prediction.

To perform inter prediction on a current video block, motion estimation unit 204 may generate motion information for the current video block by comparing one or more reference frames from buffer 213 to the current video block. Motion compensation unit 205 may determine a predicted video block for the current video block based on the motion information and decoded samples of pictures from buffer 213 other than the picture associated with the current video block.

Motion estimation unit 204 and motion compensation unit 205 may perform different operations for a current video block, for example, depending on whether the current video block is in an I slice, a P slice, or a B slice.

In some examples, motion estimation unit 204 may perform uni-directional prediction for the current video block, and motion estimation unit 204 may search reference pictures of list 0 or list 1 for a reference video block for the current video block. Motion estimation unit 204 may then generate a reference index that indicates the reference picture in list 0 or list 1 that contains the reference video block and a motion vector that indicates a spatial displacement between the current video block and the reference video block. Motion estimation unit 204 may output the reference index, a prediction direction indicator, and the motion vector as the motion information of the current video block. Motion compensation unit 205 may generate the predicted video block of the current block based on the reference video block indicated by the motion information of the current video block.

In other examples, motion estimation unit 204 may perform bi-directional prediction for the current video block, motion estimation unit 204 may search the reference pictures in list 0 for a reference video block for the current video block and may also search the reference pictures in list 1 for another reference video block for the current video block. Motion estimation unit 204 may then generate reference indexes that indicate the reference pictures in list 0 and list 1 containing the reference video blocks and motion vectors that indicate spatial displacements between the reference video blocks and the current video block. Motion estimation unit 204 may output the reference indexes and the motion vectors of the current video block as the motion information of the current video block. Motion compensation unit 205 may generate the predicted video block of the current video block based on the reference video blocks indicated by the motion information of the current video block.

In some examples, motion estimation unit 204 may output a full set of motion information for decoding processing of a decoder.

In some examples, motion estimation unit 204 may not output a full set of motion information for the current video. Rather, motion estimation unit 204 may signal the motion information of the current video block with reference to the motion information of another video block. For example, motion estimation unit 204 may determine that the motion information of the current video block is sufficiently similar to the motion information of a neighboring video block.

In one example, motion estimation unit 204 may indicate, in a syntax structure associated with the current video block, a value that indicates to the video decoder 300 that the current video block has the same motion information as the other video block.

In another example, motion estimation unit 204 may identify, in a syntax structure associated with the current video block, another video block and a motion vector difference (MVD). The motion vector difference indicates a difference between the motion vector of the current video block and the motion vector of the indicated video block. The video decoder 300 may use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.

As discussed above, video encoder 200 may predictively signal the motion vector. Two examples of predictive signaling techniques that may be implemented by video encoder 200 include advanced motion vector prediction (AMVP) and merge mode signaling.

Intra prediction unit 206 may perform intra prediction on the current video block. When intra prediction unit 206 performs intra prediction on the current video block, intra prediction unit 206 may generate prediction data for the current video block based on decoded samples of other video blocks in the same picture. The prediction data for the current video block may include a predicted video block and various syntax elements.

Residual generation unit 207 may generate residual data for the current video block by subtracting (e.g., indicated by the minus sign) the predicted video block(s) of the current video block from the current video block. The residual data of the current video block may include residual video blocks that correspond to different sample components of the samples in the current video block.

In other examples, there may be no residual data for the current video block for the current video block, for example in a skip mode, and residual generation unit 207 may not perform the subtracting operation.

Transform processing unit 208 may generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to a residual video block associated with the current video block.

After transform processing unit 208 generates a transform coefficient video block associated with the current video block, quantization unit 209 may quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values associated with the current video block.

Inverse quantization unit 210 and inverse transform unit 211 may apply inverse quantization and inverse transforms to the transform coefficient video block, respectively, to reconstruct a residual video block from the transform coefficient video block. Reconstruction unit 212 may add the reconstructed residual video block to corresponding samples from one or more predicted video blocks generated by the prediction unit 202 to produce a reconstructed video block associated with the current block for storage in the buffer 213.

After reconstruction unit 212 reconstructs the video block, loop filtering operation may be performed to reduce video blocking artifacts in the video block.

Entropy encoding unit 214 may receive data from other functional components of the video encoder 200. When entropy encoding unit 214 receives the data, entropy encoding unit 214 may perform one or more entropy encoding operations to generate entropy encoded data and output a bitstream that includes the entropy encoded data.

FIG. 11 is a block diagram illustrating an example of video decoder 300 which may be video decoder 124 in the system 100 illustrated in FIG. 9 .

The video decoder 300 may be configured to perform any or all of the embodiments of this disclosure. In the example of FIG. 11 , the video decoder 300 includes a plurality of functional components. The embodiments described in this disclosure may be shared among the various components of the video decoder 300. In some examples, a processor may be configured to perform any or all of the embodiments described in this disclosure.

In the example of FIG. 11 , video decoder 300 includes an entropy decoding unit 301, a motion compensation unit 302, an intra prediction unit 303, an inverse quantization unit 304, an inverse transformation unit 305, a reconstruction unit 306, and a buffer 307. Video decoder 300 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 200 (FIG. 10 ).

Entropy decoding unit 301 may retrieve an encoded bitstream. The encoded bitstream may include entropy coded video data (e.g., encoded blocks of video data). Entropy decoding unit 301 may decode the entropy coded video data, and from the entropy decoded video data, motion compensation unit 302 may determine motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. Motion compensation unit 302 may, for example, determine such information by performing the AMVP and merge mode.

Motion compensation unit 302 may produce motion compensated blocks, possibly performing interpolation based on interpolation filters. Identifiers for interpolation filters to be used with sub-pixel precision may be included in the syntax elements.

Motion compensation unit 302 may use interpolation filters as used by video encoder 200 during encoding of the video block to calculate interpolated values for sub-integer pixels of a reference block. Motion compensation unit 302 may determine the interpolation filters used by video encoder 200 according to received syntax information and use the interpolation filters to produce predictive blocks.

Motion compensation unit 302 may use some of the syntax information to determine sizes of blocks used to encode frame(s) and/or slice(s) of the encoded video sequence, partition information that describes how each macroblock of a picture of the encoded video sequence is partitioned, modes indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter-encoded block, and other information to decode the encoded video sequence.

Intra prediction unit 303 may use intra prediction modes for example received in the bitstream to form a prediction block from spatially adjacent blocks. Inverse quantization unit 304 inverse quantizes, i.e., de-quantizes, the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 301. Inverse transform unit 305 applies an inverse transform.

Reconstruction unit 306 may sum the residual blocks with the corresponding prediction blocks generated by motion compensation unit 302 or intra prediction unit 303 to form decoded blocks. If desired, a deblocking filter may also be applied to filter the decoded blocks in order to remove blockiness artifacts. The decoded video blocks are then stored in buffer 307, which provides reference blocks for subsequent motion compensation/intra prediction and also produces decoded video for presentation on a display device.

FIGS. 12-13 show example methods that can implement the technical solutions described above in, for example, the embodiments shown in FIGS. 7-11 .

FIG. 12 shows a flowchart for an example method 1200 of video processing includes, at operation 1210, performing a conversion between a current video block of a video and a bitstream of the video, the current video block being coded using an adaptive colour transform (ACT) mode, the conversion comprising applying an inverse ACT transform on the current video block according to a rule that specifies that a clipping operation, based on a bit depth of the current video block, is applied to an input of the inverse ACT transform.

FIG. 13 shows a flowchart for an example method 1300 of video processing includes, at operation 1310, performing a conversion between a video comprising a current video block and a bitstream of the video, wherein, during the conversion, a weighted prediction of the current video block being determined using weights, wherein the weights being signaled in the bitstream as information indictive of a difference between a number of the weights and a threshold K, and K being an integer.

A listing of solutions preferred by some embodiments is provided next.

1. A method of video processing, comprising performing a conversion between a current video block of a video and a bitstream of the video, wherein the current video block is coded using an adaptive colour transform (ACT) mode, wherein the conversion comprises applying an inverse ACT transform on the current video block according to a rule, and wherein the rule specifies that a first clipping operation, based on a bit depth of the current video block (denoted BitDepth), is applied to an input of the inverse ACT transform.

2. The method of solution 1, wherein the first clipping operation is based on a sum of the bit depth and K, and wherein K is a non-zero integer.

3. The method of solution 2, wherein K = 1.

4. The method of solution 1, wherein the first clipping operation is based on a sum of the bit depth and K, and wherein K = 0.

5. The method of any of solutions 1 to 4, wherein the first clipping operation is denoted f( a, b, x ), wherein x is a value to be clipped, a is a lower bound of the first clipping operation, and b is an upper bound of the first clipping operation, and wherein a and b are integers.

6. The method of solution 5, wherein f( a, b, x ) = ( x < a ? a ( x > b ? b x ) ).

7. The method of solution 5 or 6, wherein a = - ( 1 << ( BitDepth + K ) ).

8. The method of any of solutions 5 to 7, wherein b = ( 1 << ( BitDepth + K ) ) - 1.

9. The method of solution 1, wherein the input is associated with at least one sample of a Cb colour component or a Cr colour component of the video.

10. The method of solution 1, wherein the input is associated with a sample that excludes a sample of a Y colour component of the video or a luma component of the video.

11. The method of any of solution 1 to 10, wherein the bit depth is an input bit depth or an internal bit depth.

12. The method of any of solutions 1 to 11, wherein the rule further specifies that a second clipping operation, based on the bit depth of the current video block, is applied to an output of the inverse ACT transform.

13. The method of solution 12, wherein the output is associated with at least one sample of a Cb colour component or a Cr colour component of the video.

14. The method of solution 12, wherein the output is associated with at least one sample of a Y colour component of the video or a luma component of the video.

15. A method of video processing, comprising performing a conversion between a video comprising a current video block and a bitstream of the video, wherein, during the conversion, a weighted prediction of the current video block is determined using weights, and wherein the weights are included in the bitstream as information indictive of a difference between a number of the weights and a threshold K, where K is an integer.

16. The method of solution 15, wherein K = 1.

17. The method of solution 15, wherein the number of weights associated with a reference picture list 0 minus one is included in the bitstream.

18. The method of solution 15, wherein a predictive coding of the number of weights associated with a reference picture list X is included in the bitstream.

19. The method of solution 18, wherein the predictive coding comprises a difference between the number of weights associated with the reference picture list X and the number of weights associated with the reference picture list (1-X).

20. The method of solution 18 or 19, wherein X = 0 or X =1.

21. The method of any of solutions 1 to 20, wherein the conversion comprises decoding the video from the bitstream.

22. The method of any of solutions 1 to 20, wherein the conversion comprises encoding the video into the bitstream.

23. The method of any of solutions 1 to 20, wherein the conversion comprises generating the bitstream from the video, and wherein the method further comprises storing the bitstream in a non-transitory computer-readable recording medium.

24. A method of storing a bitstream representing a video to a computer-readable recording medium, comprising generating a bitstream from a video according to a method described in any one or more of solutions 1 to 20, and writing the bitstream to the computer-readable recording medium.

25. A video processing apparatus comprising a processor configured to implement a method recited in any one or more of solutions 1 to 24.

26. A computer-readable medium having instructions stored thereon, the instructions, when executed, causing a processor to implement a method recited in one or more of solutions 1 to 24.

27. A computer readable medium that stores the bitstream generated according to any one or more of solutions 1 to 24.

28. A video processing apparatus for storing a bitstream, wherein the video processing apparatus is configured to implement a method recited in any one or more of solutions 1 to 24.

29. A bitstream generated according to a method or a system disclosed herein.

Another listing of solutions preferred by some embodiments is provided next.

P1. A method of video processing, comprising performing a determination whether to enable a chroma block-based delta pulse code modulation (BDPCM) mode for a video block of a video based on whether a usage of an adaptive colour transform (ACT) mode and/or a luma BDPCM mode for the video block is enabled; and performing a conversion between the video block and a bitstream representation of the video according to the determinization.

P2. The method of solution P1, wherein a signaling for a first value for a first flag associated with enabling the chroma BDPCM mode is determined based on a signaling of the ACT mode being enabled for the video block and a signaling of a second value for a second flag associated with the usage of the luma BDPCM mode.

P3. The method of solution P2, wherein the first value for the first flag has a false value in response to the ACT mode being enabled and the second value for the second flag having a false value.

P4. The method of solution P2, wherein the first value for the first flag has a true value in response to the second value for the second flag having a true value.

P5. The method of solution P1, wherein a signaling of the ACT mode for the video block is conditionally based on a same BDPCM prediction direction being used for luma samples and chroma samples of the video block.

P6. The method of solution P5, wherein the signaling of the ACT mode is indicated after a signaling of the chroma BDPCM mode and the luma BDPCM mode.

P7. The method of solution P1, wherein in response to the usage of the ACT mode being enabled, a first value indicative of a first prediction direction of the chroma BDPCM mode is derived from a second value indicative of a second prediction direction of the luma BDPCM mode.

P8. The method of solution P7, wherein the first value indicative of the first prediction direction of the chroma BDPCM mode is the same as the second value indicative of the second prediction direction of the luma BDPCM mode.

P9. The method of solution P8, wherein the first prediction direction of the chroma BDPCM mode and the second prediction direction of the luma BDPCM mode are in a horizontal direction.

P10. The method of solution P8, wherein the first prediction direction of the chroma BDPCM mode and the second prediction direction of the luma BDPCM mode are in a vertical direction.

P11. The method of solution P1, wherein in response to the usage of the ACT mode being disabled, a first value indicative of a first prediction direction of the chroma BDPCM mode is zero.

P12. A method of video processing, comprising performing a determination whether to enable a block-based delta pulse code modulation (BDPCM) mode for a video block of a video based on whether a usage of an adaptive colour transform (ACT) mode for the video block is enabled; and performing a conversion between the video block and a bitstream representation of the video according to the determinization.

P13. The method of solution P12, wherein the BDPCM mode is disabled for the video block in response to the ACT mode being enabled for the video block.

P14. The method of solution P13, wherein a first flag indicative of the BDPCM mode is signaled after a second flag indicative of the ACT mode.

P15. The method of solution P13, wherein a flag indicative of the BDPCM mode is not signaled, wherein the flag is determined to be a false value or zero.

P16. The method of solution P12, wherein the ACT mode is disabled for the video block in response to the BDPCM mode being enabled for the video block.

P17. The method of solution P16, wherein a first flag indicative of the BDPCM mode is signaled before a second flag indicative of the ACT mode.

P18. The method of solution P16, wherein a flag indicative of the ACT mode is not signaled, wherein the flag is determined to be a false value or zero.

P19. The method of any of solutions P12 to P18, wherein the BDPCM mode includes a luma BDPCM mode and/or a chroma BDPCM mode.

P20. The method of solution P1, wherein the ACT mode is applied when the chroma BDPCM mode and the luma BDPCM mode are associated with different prediction modes.

P21. The method of solution P20, wherein a forward ACT mode is applied after the chroma BDPCM mode or the luma BDPCM mode.

P22. The method of any of solution P1 to P21, wherein a quantization parameter (QP) for the video block is clipped in response to the ACT mode being enabled.

P23. The method of solution P22, wherein a clipping function for clipping the QP is defined as (l, h, x), where l is a lowest possible value of an input x and h is a highest possible value of an input x.

P24. The method of solution P23, wherein l is equal to zero.

P25. The method of solution P23, wherein h is equal to 63.

P26. The method of solution P22, wherein the QP for the video block is clipped after the QP is adjusted for the ACT mode.

P27. The method of solution P23, wherein in response to a transform skip being applied to the video block, l is equal to a minimal allowed QP for a transform skip mode.

P28. The method of any of solution P23 to P26, wherein l, h, m, n and/or k are integer numbers that depend on (i) a message signaled in the DPS/SPS/VPS/PPS/APS/picture header/slice header/tile group header/ Largest coding unit (LCU)/Coding unit (CU)/LCU row/group of LCUs/TU/PU block/Video coding unit, (ii) a position of CU/PU/TU/block/Video coding unit, (iii) coded modes of blocks containing the samples along the edges, (iv) transform matrices applied to the blocks containing the samples along the edges, (v) block dimension/Block shape of current block and/or its neighboring blocks, (vi) indication of the colour format (such as 4:2:0, 4:4:4, RGB or YUV), (vii) a coding tree structure (such as dual tree or single tree), (viii) a slice/tile group type and/or picture type, (ix) a colour component (e.g. may be only applied on Cb or Cr), (x) a temporal layer ID, or (xi) profiles/Levels/Tiers of a standard.

P29. The method of any of solution P23 to P26, wherein l, h, m, n and/or k are signaled to a decoder.

P30. The method of solution P29, wherein a colour format is 4:2:0 or 4:2:2.

P31. The method of any of solutions P1 to P30, wherein an indication for the ACT mode or the BDPCM mode or the chroma BDPCM mode or the luma BDPCM mode is signaled in a sequence, a picture, a slice, a tile, a brick, or a video region-level.

P32. A method of video processing, comprising determining that a joint coding of chroma residuals (JCCR) tool is used on a video block of a video for which an adaptive colour transform (ACT) mode is enabled; and performing, based on the determining, a conversion between the video block and a bitstream representation of the video, wherein a quantization parameter (QP) of the ACT mode is based on a mode of the JCCR tool.

P33. The method of solution P32, wherein the QP is -5 or -6 upon a determination that the mode of the JCCR tool is 1.

P34. The method of solution P32, wherein the QP is -4 or -5 upon a determination that the mode of the JCCR tool is 3.

P35. The method of any of solutions P1 to P34, wherein the conversion comprises parsing and decoding the coded representation to generate video pixels.

P36. The method of any of solutions P1 to P34, wherein the conversion comprises generating the coded representation by encoding the video.

P37. A video decoding apparatus comprising a processor configured to implement a method recited in one or more of solutions P1 to P36.

P38. A video encoding apparatus comprising a processor configured to implement a method recited in one or more of solutions P1 to P36.

P39. A computer program product having computer code stored thereon, the code, when executed by a processor, causes the processor to implement a method recited in any of solutions P1 to P36.

In the present disclosure, the term “video processing” may refer to video encoding, video decoding, video compression or video decompression. For example, video compression algorithms may be applied during conversion from pixel representation of a video to a corresponding bitstream representation or vice versa. The bitstream representation of a current video block may, for example, correspond to bits that are either co-located or spread in different places within the bitstream, as is defined by the syntax. For example, a macroblock may be encoded in terms of transformed and coded error residual values and also using bits in headers and other fields in the bitstream.

The disclosed and other solutions, examples, embodiments, modules and the functional operations described in this disclosure can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed herein and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this disclosure can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., a field-programmable gate array (FPGA) or an application-specific integrated circuit (ASIC).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random-access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., erasable programmable read-only memory (EPROM), electrically EPROM (EEPROM), and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and compact disc read-only memory (CD ROM) and digital versatile disc read-only memory (DVD-ROM) disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

While the present disclosure contains many specifics, these should not be construed as limitations on the scope of any subject matter or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments. Certain features that are described in the present disclosure in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in the present disclosure should not be understood as requiring such separation in all embodiments.

Only a few implementations and examples are described and other implementations, enhancements and variations can be made based on what is described and illustrated in the present disclosure. 

What is claimed is:
 1. A method of processing video data, comprising: performing a conversion between a current video block of a video and a bitstream of the video, wherein when the current video block is coded using a colour transform mode, the conversion comprises applying an inverse colour transform on the current video block according to a rule, wherein the rule specifies that a clipping operation is applied to an input of the inverse colour transform, wherein the clipping operation is based on a sum of a bit depth of the current video block and K, and wherein K is a non-zero integer.
 2. The method of claim 1, wherein K =
 1. 3. The method of claim 1, wherein the clipping operation is denoted ƒ( a, b, x ), wherein x is a value to be clipped, a is a lower bound of the clipping operation, and b is an upper bound of the clipping operation, and wherein a and b are integers.
 4. The method of claim 3, wherein ƒ(a, b, x ) = ( x < a ? a : ( x > b ? b : x ) ).
 5. The method of claim 4, wherein a = - ( 1 << ( BitDepth + K ) ).
 6. The method of claim 4, wherein b = ( 1 << ( BitDepth + K ) ) -
 1. 7. The method of claim 1, wherein the conversion comprises decoding the video from the bitstream.
 8. The method of claim 1, wherein the conversion comprises encoding the video into the bitstream.
 9. An apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: perform a conversion between a current video block of a video and a bitstream of the video, wherein when the current video block is coded using a colour transform mode, the conversion comprises applying an inverse colour transform on the current video block according to a rule, wherein the rule specifies that a clipping operation is applied to an input of the inverse colour transform, wherein the clipping operation is based on a sum of a bit depth of the current video block and K, and wherein K is a non-zero integer.
 10. The apparatus of claim 9, wherein K =
 1. 11. The apparatus of claim 9, wherein the clipping operation is denoted f( a, b, x ), wherein x is a value to be clipped, a is a lower bound of the clipping operation, and b is an upper bound of the clipping operation, and wherein a and b are integers.
 12. The apparatus of claim 11, wherein f( a, b, x ) = ( x < a ? a : ( x > b ? b : x ) ), wherein a = - ( 1 << ( BitDepth + K) ), and wherein b = ( 1 << ( BitDepth + K) ) -
 1. 13. A non-transitory computer-readable storage medium storing instructions that cause a processor to: perform a conversion between a current video block of a video and a bitstream of the video, wherein when the current video block is coded using a colour transform mode, the conversion comprises applying an inverse colour transform on the current video block according to a rule, wherein the rule specifies that a clipping operation is applied to an input of the inverse colour transform, wherein the clipping operation is based on a sum of a bit depth of the current video block and K, and wherein K is a non-zero integer.
 14. The non-transitory computer-readable storage medium of claim 13, wherein K =
 1. 15. The non-transitory computer-readable storage medium of claim 13, wherein the clipping operation is denoted f( a, b, x ), wherein x is a value to be clipped, a is a lower bound of the clipping operation, and b is an upper bound of the clipping operation, and wherein a and b are integers.
 16. The non-transitory computer-readable storage medium of claim 15, wherein f( a, b, x ) = ( x < a ? a : ( x > b ? b : x ) ), wherein a = - ( 1 << ( BitDepth + K ) ), and wherein b = ( 1 << ( BitDepth + K) ) -
 1. 17. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: generating the bitstream for a current video block of the video, wherein when the current video block is coded using a colour transform mode, the generating the bitstream comprises applying an inverse colour transform on the current video block according to a rule, wherein the rule specifies that a clipping operation is applied to an input of the inverse colour transform, wherein the clipping operation is based on a sum of a bit depth of the current video block and K, and wherein K is a non-zero integer.
 18. The non-transitory computer-readable recording medium of claim 17, wherein K =
 1. 19. The non-transitory computer-readable recording medium of claim 17, wherein the clipping operation is denoted f( a, b, x ), wherein x is a value to be clipped, a is a lower bound of the clipping operation, and b is an upper bound of the clipping operation, and wherein a and b are integers.
 20. The non-transitory computer-readable recording medium of claim 19, wherein f( a, b, x ) = ( x < a ? a : ( x > b ? b : x ) ), wherein a = - ( 1 << ( BitDepth + K ) ), and wherein b = ( 1 << ( BitDepth + K) ) -
 1. 